Base | Representation |
---|---|
bin | 1010111011001001101010… |
… | …0101001111001000111111 |
3 | 1120112021022200102220202111 |
4 | 2232302122211033020333 |
5 | 3033243141413342343 |
6 | 41313531500034451 |
7 | 2346534520354342 |
oct | 256623245171077 |
9 | 46467280386674 |
10 | 12011322012223 |
11 | 3910a781611a6 |
12 | 141ba5b532a27 |
13 | 6918802512c1 |
14 | 2d74cb552459 |
15 | 15c696dbac9d |
hex | aec9a94f23f |
12011322012223 has 16 divisors (see below), whose sum is σ = 12268164142080. Its totient is φ = 11756976184800.
The previous prime is 12011322012199. The next prime is 12011322012253. The reversal of 12011322012223 is 32221022311021.
It is a cyclic number.
It is not a de Polignac number, because 12011322012223 - 25 = 12011322012191 is a prime.
It is a super-2 number, since 2×120113220122232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12011322012194 and 12011322012203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011322012253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6568438 + ... + 8195548.
It is an arithmetic number, because the mean of its divisors is an integer number (766760258880).
Almost surely, 212011322012223 is an apocalyptic number.
12011322012223 is a deficient number, since it is larger than the sum of its proper divisors (256842129857).
12011322012223 is a wasteful number, since it uses less digits than its factorization.
12011322012223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1627878.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12011322012223 its reverse (32221022311021), we get a palindrome (44232344323244).
The spelling of 12011322012223 in words is "twelve trillion, eleven billion, three hundred twenty-two million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •