Base | Representation |
---|---|
bin | 101111110011000111100101… |
… | …001110001011011011011100 |
3 | 1000120022221012022222201212020 |
4 | 233303013211032023123130 |
5 | 210023230122110031022 |
6 | 2023034111532140140 |
7 | 62164652564001615 |
oct | 5763074516133334 |
9 | 1016287168881766 |
10 | 210221020002012 |
11 | 60a8a263382158 |
12 | 1b6b22aa307650 |
13 | 903b9ac532686 |
14 | 39caa74792c0c |
15 | 19484e7a0535c |
hex | bf31e538b6dc |
210221020002012 has 24 divisors (see below), whose sum is σ = 491240256508176. Its totient is φ = 69970167166848.
The previous prime is 210221020001987. The next prime is 210221020002013. The reversal of 210221020002012 is 210200020122012.
It is a junction number, because it is equal to n+sod(n) for n = 210221020001982 and 210221020002000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210221020002013) 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, 12938262433 + ... + 12938278680.
It is an arithmetic number, because the mean of its divisors is an integer number (20468344021174).
Almost surely, 2210221020002012 is an apocalyptic number.
It is an amenable number.
210221020002012 is an abundant number, since it is smaller than the sum of its proper divisors (281019236506164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210221020002012 is a wasteful number, since it uses less digits than its factorization.
210221020002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25876541797 (or 25876541795 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 210221020002012 its reverse (210200020122012), we get a palindrome (420421040124024).
The spelling of 210221020002012 in words is "two hundred ten trillion, two hundred twenty-one billion, twenty million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •