Base | Representation |
---|---|
bin | 1010111010100011100101… |
… | …1011000100001000000001 |
3 | 1120111021221102201120120112 |
4 | 2232220321123010020001 |
5 | 3033111224104133441 |
6 | 41305121414121105 |
7 | 2346023332024043 |
oct | 256507133041001 |
9 | 46437842646515 |
10 | 12001102021121 |
11 | 390770324a664 |
12 | 1419a88950195 |
13 | 690911aca4a5 |
14 | 2d6bdc0c5a93 |
15 | 15c299a554eb |
hex | aea396c4201 |
12001102021121 has 16 divisors (see below), whose sum is σ = 12728951152128. Its totient is φ = 11275697932800.
The previous prime is 12001102021099. The next prime is 12001102021127. The reversal of 12001102021121 is 12112020110021.
It is a cyclic number.
It is not a de Polignac number, because 12001102021121 - 234 = 11983922151937 is a prime.
It is a super-2 number, since 2×120011020211212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12001102021096 and 12001102021105.
It is not an unprimeable number, because it can be changed into a prime (12001102021127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33559541 + ... + 33915261.
It is an arithmetic number, because the mean of its divisors is an integer number (795559447008).
Almost surely, 212001102021121 is an apocalyptic number.
It is an amenable number.
12001102021121 is a deficient number, since it is larger than the sum of its proper divisors (727849131007).
12001102021121 is a wasteful number, since it uses less digits than its factorization.
12001102021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 359152.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12001102021121 its reverse (12112020110021), we get a palindrome (24113122131142).
The spelling of 12001102021121 in words is "twelve trillion, one billion, one hundred two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •