Base | Representation |
---|---|
bin | 101111110000001110001110… |
… | …101101001000000010110101 |
3 | 1000112121220111021202011112020 |
4 | 233300032032231020002311 |
5 | 210012000024000014310 |
6 | 2022402435210543353 |
7 | 62144405642624250 |
oct | 5760161655100265 |
9 | 1015556437664466 |
10 | 210022000001205 |
11 | 60a12914813947 |
12 | 1b67b806a37b59 |
13 | 9025cb3269aa2 |
14 | 39c11948d4097 |
15 | 194324a611170 |
hex | bf038eb480b5 |
210022000001205 has 128 divisors (see below), whose sum is σ = 395310790803456. Its totient is φ = 93225086572800.
The previous prime is 210022000001173. The next prime is 210022000001207. The reversal of 210022000001205 is 502100000220012.
It is not a de Polignac number, because 210022000001205 - 25 = 210022000001173 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210022000001207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2536119250 + ... + 2536202060.
It is an arithmetic number, because the mean of its divisors is an integer number (3088365553152).
Almost surely, 2210022000001205 is an apocalyptic number.
It is an amenable number.
210022000001205 is a deficient number, since it is larger than the sum of its proper divisors (185288790802251).
210022000001205 is a wasteful number, since it uses less digits than its factorization.
210022000001205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86927.
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 210022000001205 its reverse (502100000220012), we get a palindrome (712122000221217).
The spelling of 210022000001205 in words is "two hundred ten trillion, twenty-two billion, one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •