Base | Representation |
---|---|
bin | 1010111011101110000110… |
… | …0100110111101110001111 |
3 | 1120120012120100011021011211 |
4 | 2232323201210313232033 |
5 | 3033423204334030411 |
6 | 41322230221155251 |
7 | 2350332065564515 |
oct | 256734144675617 |
9 | 46505510137154 |
10 | 12021103033231 |
11 | 3915137300036 |
12 | 142192b0bbb27 |
13 | 69277b76a9b6 |
14 | 2d7b785924b5 |
15 | 15ca6a921221 |
hex | aeee1937b8f |
12021103033231 has 8 divisors (see below), whose sum is σ = 12439220124800. Its totient is φ = 11604882165120.
The previous prime is 12021103033207. The next prime is 12021103033309. The reversal of 12021103033231 is 13233030112021.
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 12021103033231 - 215 = 12021103000463 is a prime.
It is a super-2 number, since 2×120211030332312 (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 (12021103033531) 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, 474042966 + ... + 474068323.
It is an arithmetic number, because the mean of its divisors is an integer number (1554902515600).
Almost surely, 212021103033231 is an apocalyptic number.
12021103033231 is a deficient number, since it is larger than the sum of its proper divisors (418117091569).
12021103033231 is an equidigital number, since it uses as much as digits as its factorization.
12021103033231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 948111729.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12021103033231 its reverse (13233030112021), we get a palindrome (25254133145252).
The spelling of 12021103033231 in words is "twelve trillion, twenty-one billion, one hundred three million, thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •