Base | Representation |
---|---|
bin | 1010111011101110001010… |
… | …0110000100000010001111 |
3 | 1120120012121112022111222002 |
4 | 2232323202212010002033 |
5 | 3033423223222414043 |
6 | 41322232031342515 |
7 | 2350332364053134 |
oct | 256734246040217 |
9 | 46505545274862 |
10 | 12021120123023 |
11 | 3915145a12930 |
12 | 1421934981a3b |
13 | 6927821725bb |
14 | 2d7b7a96058b |
15 | 15ca6c199bb8 |
hex | aeee298408f |
12021120123023 has 8 divisors (see below), whose sum is σ = 13885358003280. Its totient is φ = 10285450372480.
The previous prime is 12021120122993. The next prime is 12021120123071. The reversal of 12021120123023 is 32032102112021.
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 12021120123023 - 210 = 12021120121999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12021120122986 and 12021120123004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021120123223) 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, 32142032228 + ... + 32142032601.
It is an arithmetic number, because the mean of its divisors is an integer number (1735669750410).
Almost surely, 212021120123023 is an apocalyptic number.
12021120123023 is a deficient number, since it is larger than the sum of its proper divisors (1864237880257).
12021120123023 is a wasteful number, since it uses less digits than its factorization.
12021120123023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64284064857.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12021120123023 its reverse (32032102112021), we get a palindrome (44053222235044).
The spelling of 12021120123023 in words is "twelve trillion, twenty-one billion, one hundred twenty million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •