Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …000011111001010110011 |
3 | 11021212220022101110202012 |
4 | 101220330300133022303 |
5 | 124330041212333021 |
6 | 2324513235313135 |
7 | 153402310006655 |
oct | 21507460371263 |
9 | 4255808343665 |
10 | 1212200121011 |
11 | 428100403630 |
12 | 176b2344b7ab |
13 | 8a405049919 |
14 | 4295695a6d5 |
15 | 217eacdb35b |
hex | 11a3cc1f2b3 |
1212200121011 has 16 divisors (see below), whose sum is σ = 1411605792000. Its totient is φ = 1029295864800.
The previous prime is 1212200120993. The next prime is 1212200121029. The reversal of 1212200121011 is 1101210022121.
It is an interprime number because it is at equal distance from previous prime (1212200120993) and next prime (1212200121029).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212200121011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212200121511) 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, 40830236 + ... + 40859913.
It is an arithmetic number, because the mean of its divisors is an integer number (88225362000).
Almost surely, 21212200121011 is an apocalyptic number.
1212200121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1212200121011 is a deficient number, since it is larger than the sum of its proper divisors (199405670989).
1212200121011 is a wasteful number, since it uses less digits than its factorization.
1212200121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81690250.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1212200121011 its reverse (1101210022121), we get a palindrome (2313410143132).
The spelling of 1212200121011 in words is "one trillion, two hundred twelve billion, two hundred million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •