Base | Representation |
---|---|
bin | 110000001110011101101000… |
… | …011000011011000001111001 |
3 | 1000210222120111010102122211220 |
4 | 300032131220120123001321 |
5 | 210300022022012223001 |
6 | 2031033241152342253 |
7 | 62450504504512422 |
oct | 6016355030330171 |
9 | 1023876433378756 |
10 | 212100121211001 |
11 | 61644179a91931 |
12 | 1b956511544989 |
13 | 9146c5661a38a |
14 | 3a539b47b6649 |
15 | 197c326b8dc36 |
hex | c0e76861b079 |
212100121211001 has 8 divisors (see below), whose sum is σ = 282802285765920. Its totient is φ = 141399018731712.
The previous prime is 212100121210987. The next prime is 212100121211023. The reversal of 212100121211001 is 100112121001212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212100121211001 - 239 = 211550365397113 is a prime.
It is a super-2 number, since 2×2121001212110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (212100121211081) 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, 265052815 + ... + 265851828.
It is an arithmetic number, because the mean of its divisors is an integer number (35350285720740).
Almost surely, 2212100121211001 is an apocalyptic number.
It is an amenable number.
212100121211001 is a deficient number, since it is larger than the sum of its proper divisors (70702164554919).
212100121211001 is a wasteful number, since it uses less digits than its factorization.
212100121211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531037815.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 212100121211001 its reverse (100112121001212), we get a palindrome (312212242212213).
The spelling of 212100121211001 in words is "two hundred twelve trillion, one hundred billion, one hundred twenty-one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •