Base | Representation |
---|---|
bin | 1010111011101110001000… |
… | …0011101110110101111011 |
3 | 1120120012120220101021200212 |
4 | 2232323202003232311323 |
5 | 3033423213421421243 |
6 | 41322231110421335 |
7 | 2350332224421011 |
oct | 256734203566573 |
9 | 46505526337625 |
10 | 12021111123323 |
11 | 3915140926265 |
12 | 142193196184b |
13 | 692780341133 |
14 | 2d7b7969a8b1 |
15 | 15ca6b4bd318 |
hex | aeee20eed7b |
12021111123323 has 8 divisors (see below), whose sum is σ = 12156792044400. Its totient is φ = 11885443808128.
The previous prime is 12021111123277. The next prime is 12021111123347. The reversal of 12021111123323 is 32332111112021.
It is a happy number.
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 12021111123323 - 220 = 12021110074747 is a prime.
It is a super-2 number, since 2×120211111233232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12021111123353) 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, 1619213 + ... + 5163726.
It is an arithmetic number, because the mean of its divisors is an integer number (1519599005550).
Almost surely, 212021111123323 is an apocalyptic number.
12021111123323 is a deficient number, since it is larger than the sum of its proper divisors (135680921077).
12021111123323 is an equidigital number, since it uses as much as digits as its factorization.
12021111123323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6802941.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 12021111123323 its reverse (32332111112021), we get a palindrome (44353222235344).
The spelling of 12021111123323 in words is "twelve trillion, twenty-one billion, one hundred eleven million, one hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •