Base | Representation |
---|---|
bin | 110000001110011101101000… |
… | …011100001100101110111101 |
3 | 1000210222120111012021221220022 |
4 | 300032131220130030232331 |
5 | 210300022022240413041 |
6 | 2031033241225501525 |
7 | 62450504516104655 |
oct | 6016355034145675 |
9 | 1023876435257808 |
10 | 212100122201021 |
11 | 6164417a5a872a |
12 | 1b9565119418a5 |
13 | 9146c568a5ba2 |
14 | 3a539b4993365 |
15 | 197c326cd724b |
hex | c0e76870cbbd |
212100122201021 has 8 divisors (see below), whose sum is σ = 212445483614784. Its totient is φ = 211754789991360.
The previous prime is 212100122200997. The next prime is 212100122201041. The reversal of 212100122201021 is 120102221001212.
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 212100122201021 - 226 = 212100055092157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212100122201041) 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, 7259786 + ... + 21838148.
It is an arithmetic number, because the mean of its divisors is an integer number (26555685451848).
Almost surely, 2212100122201021 is an apocalyptic number.
It is an amenable number.
212100122201021 is a deficient number, since it is larger than the sum of its proper divisors (345361413763).
212100122201021 is a wasteful number, since it uses less digits than its factorization.
212100122201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14602051.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 212100122201021 its reverse (120102221001212), we get a palindrome (332202343202233).
The spelling of 212100122201021 in words is "two hundred twelve trillion, one hundred billion, one hundred twenty-two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •