Base | Representation |
---|---|
bin | 1010111010100011101010… |
… | …1000000011011001001101 |
3 | 1120111021222211200221012102 |
4 | 2232220322220003121031 |
5 | 3033111244241000323 |
6 | 41305123414444445 |
7 | 2346023665412003 |
oct | 256507250033115 |
9 | 46437884627172 |
10 | 12001122203213 |
11 | 3907713684780 |
12 | 1419a93663725 |
13 | 690916045760 |
14 | 2d6c00a5aa73 |
15 | 15c29b6e0328 |
hex | aea3aa0364d |
12001122203213 has 32 divisors (see below), whose sum is σ = 14431175818752. Its totient is φ = 9833892868800.
The previous prime is 12001122203177. The next prime is 12001122203251. The reversal of 12001122203213 is 31230222110021.
It is not a de Polignac number, because 12001122203213 - 28 = 12001122202957 is a prime.
It is a super-4 number, since 4×120011222032134 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001122200213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21684806 + ... + 22231352.
It is an arithmetic number, because the mean of its divisors is an integer number (450974244336).
Almost surely, 212001122203213 is an apocalyptic number.
12001122203213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12001122203213 is a deficient number, since it is larger than the sum of its proper divisors (2430053615539).
12001122203213 is a wasteful number, since it uses less digits than its factorization.
12001122203213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550185.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12001122203213 its reverse (31230222110021), we get a palindrome (43231344313234).
The spelling of 12001122203213 in words is "twelve trillion, one billion, one hundred twenty-two million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •