Base | Representation |
---|---|
bin | 1010111010100100000001… |
… | …1110010000110111000111 |
3 | 1120111022020200021210000022 |
4 | 2232221000132100313013 |
5 | 3033111444344101411 |
6 | 41305141241205355 |
7 | 2346026266260101 |
oct | 256510036206707 |
9 | 46438220253008 |
10 | 12001220300231 |
11 | 3907763a96498 |
12 | 1419b0049085b |
13 | 690930471026 |
14 | 2d6c0dab4571 |
15 | 15c2a511aedb |
hex | aea40790dc7 |
12001220300231 has 8 divisors (see below), whose sum is σ = 12314525477760. Its totient is φ = 11689469987832.
The previous prime is 12001220300203. The next prime is 12001220300297. The reversal of 12001220300231 is 13200302210021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12001220300231 - 226 = 12001153191367 is a prime.
It is a super-2 number, since 2×120012203002312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001220360231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 388700645 + ... + 388731518.
It is an arithmetic number, because the mean of its divisors is an integer number (1539315684720).
Almost surely, 212001220300231 is an apocalyptic number.
12001220300231 is a deficient number, since it is larger than the sum of its proper divisors (313305177529).
12001220300231 is an equidigital number, since it uses as much as digits as its factorization.
12001220300231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777432565.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12001220300231 its reverse (13200302210021), we get a palindrome (25201522510252).
The spelling of 12001220300231 in words is "twelve trillion, one billion, two hundred twenty million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •