Base | Representation |
---|---|
bin | 1010111011001100100100… |
… | …0100101100110110100011 |
3 | 1120112100100001011000202002 |
4 | 2232303021010230312203 |
5 | 3033301241103343243 |
6 | 41314141122114215 |
7 | 2346563041302200 |
oct | 256631104546643 |
9 | 46470301130662 |
10 | 12012102012323 |
11 | 3911338481886 |
12 | 14200387ab96b |
13 | 691975a20b1a |
14 | 2d7562d92ca7 |
15 | 15c6e05e1eb8 |
hex | aecc912cda3 |
12012102012323 has 24 divisors (see below), whose sum is σ = 14795943808464. Its totient is φ = 9689959910400.
The previous prime is 12012102012319. The next prime is 12012102012389. The reversal of 12012102012323 is 32321020121021.
12012102012323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12012102012323 - 22 = 12012102012319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12012102012295 and 12012102012304.
It is not an unprimeable number, because it can be changed into a prime (12012102012023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17159003 + ... + 17845323.
It is an arithmetic number, because the mean of its divisors is an integer number (616497658686).
Almost surely, 212012102012323 is an apocalyptic number.
12012102012323 is a deficient number, since it is larger than the sum of its proper divisors (2783841796141).
12012102012323 is a wasteful number, since it uses less digits than its factorization.
12012102012323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 707363 (or 707356 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12012102012323 its reverse (32321020121021), we get a palindrome (44333122133344).
The spelling of 12012102012323 in words is "twelve trillion, twelve billion, one hundred two million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •