Base | Representation |
---|---|
bin | 1010111010100011111101… |
… | …1000100010101001101111 |
3 | 1120111022012101220012101200 |
4 | 2232220333120202221233 |
5 | 3033111430204214043 |
6 | 41305135345340543 |
7 | 2346025655024553 |
oct | 256507730425157 |
9 | 46438171805350 |
10 | 12001202023023 |
11 | 3907754742564 |
12 | 1419ab6337753 |
13 | 690929741b05 |
14 | 2d6c0b4b7863 |
15 | 15c2a370a7d3 |
hex | aea3f622a6f |
12001202023023 has 12 divisors (see below), whose sum is σ = 17345897260848. Its totient is φ = 7995803961600.
The previous prime is 12001202023001. The next prime is 12001202023067. The reversal of 12001202023023 is 32032020210021.
It is not a de Polignac number, because 12001202023023 - 216 = 12001201957487 is a prime.
It is a super-2 number, since 2×120012020230232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12001202022987 and 12001202023005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001202023423) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 416433715 + ... + 416462532.
It is an arithmetic number, because the mean of its divisors is an integer number (1445491438404).
Almost surely, 212001202023023 is an apocalyptic number.
12001202023023 is a deficient number, since it is larger than the sum of its proper divisors (5344695237825).
12001202023023 is a wasteful number, since it uses less digits than its factorization.
12001202023023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832897854 (or 832897851 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 12001202023023 its reverse (32032020210021), we get a palindrome (44033222233044).
The spelling of 12001202023023 in words is "twelve trillion, one billion, two hundred two million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •