Base | Representation |
---|---|
bin | 101101110000000001011101… |
… | …110101001111101100100101 |
3 | 222101102200212022210012012002 |
4 | 231300001131311033230211 |
5 | 202333130042220401041 |
6 | 1551535335355535045 |
7 | 60245046641330366 |
oct | 5560013565175445 |
9 | 871380768705162 |
10 | 201212202122021 |
11 | 59126685563302 |
12 | 1a69833345a485 |
13 | 88372c985951c |
14 | 3798a18941b6d |
15 | 183ded012359b |
hex | b7005dd4fb25 |
201212202122021 has 16 divisors (see below), whose sum is σ = 213338550297600. Its totient is φ = 189239637566448.
The previous prime is 201212202121981. The next prime is 201212202122053. The reversal of 201212202122021 is 120221202212102.
It is a cyclic number.
It is not a de Polignac number, because 201212202122021 - 234 = 201195022252837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201212202121984 and 201212202122002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201212202152021) 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, 43119026 + ... + 47557068.
It is an arithmetic number, because the mean of its divisors is an integer number (13333659393600).
Almost surely, 2201212202122021 is an apocalyptic number.
It is an amenable number.
201212202122021 is a deficient number, since it is larger than the sum of its proper divisors (12126348175579).
201212202122021 is a wasteful number, since it uses less digits than its factorization.
201212202122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4455368.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 201212202122021 its reverse (120221202212102), we get a palindrome (321433404334123).
The spelling of 201212202122021 in words is "two hundred one trillion, two hundred twelve billion, two hundred two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •