Base | Representation |
---|---|
bin | 1010111011001100101001… |
… | …0001010111100000110001 |
3 | 1120112100101102222002120112 |
4 | 2232303022101113200301 |
5 | 3033301311230010001 |
6 | 41314143120551105 |
7 | 2346563404156046 |
oct | 256631221274061 |
9 | 46470342862515 |
10 | 12012122110001 |
11 | 3911348859532 |
12 | 1420043482495 |
13 | 691979c39840 |
14 | 2d75659051cd |
15 | 15c6e2261cbb |
hex | aecca457831 |
12012122110001 has 8 divisors (see below), whose sum is σ = 12943700942760. Its totient is φ = 11081624625792.
The previous prime is 12012122109991. The next prime is 12012122110019. The reversal of 12012122110001 is 10001122121021.
It can be written as a sum of positive squares in 4 ways, for example, as 1650772710976 + 10361349399025 = 1284824^2 + 3218905^2 .
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 12012122110001 - 242 = 7614075598897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12012122160001) 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, 270314060 + ... + 270358493.
It is an arithmetic number, because the mean of its divisors is an integer number (1617962617845).
Almost surely, 212012122110001 is an apocalyptic number.
It is an amenable number.
12012122110001 is a deficient number, since it is larger than the sum of its proper divisors (931578832759).
12012122110001 is a wasteful number, since it uses less digits than its factorization.
12012122110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540674275.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12012122110001 its reverse (10001122121021), we get a palindrome (22013244231022).
The spelling of 12012122110001 in words is "twelve trillion, twelve billion, one hundred twenty-two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •