Base | Representation |
---|---|
bin | 1001010010111111111111… |
… | …1100010111000001100010 |
3 | 1100012012211020022022201221 |
4 | 2110233333330113001202 |
5 | 2314434144412211320 |
6 | 33423533130045254 |
7 | 2103342133446325 |
oct | 224577774270142 |
9 | 40165736268657 |
10 | 10222021210210 |
11 | 32911535383a7 |
12 | 119111a27982a |
13 | 591c178148a4 |
14 | 274a69b127bc |
15 | 12ad717d53aa |
hex | 94bfff17062 |
10222021210210 has 8 divisors (see below), whose sum is σ = 18399638178396. Its totient is φ = 4088808484080.
The previous prime is 10222021210171. The next prime is 10222021210211. The reversal of 10222021210210 is 1201212022201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9482082331401 + 739938878809 = 3079299^2 + 860197^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102220212102102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10222021210211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 511101060501 + ... + 511101060520.
Almost surely, 210222021210210 is an apocalyptic number.
10222021210210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10222021210210 is a deficient number, since it is larger than the sum of its proper divisors (8177616968186).
10222021210210 is a wasteful number, since it uses less digits than its factorization.
10222021210210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022202121028.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10222021210210 its reverse (1201212022201), we get a palindrome (11423233232411).
The spelling of 10222021210210 in words is "ten trillion, two hundred twenty-two billion, twenty-one million, two hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •