Base | Representation |
---|---|
bin | 101111110010110100000000… |
… | …011101101010110100110010 |
3 | 1000120020220221120022022222121 |
4 | 233302310000131222310302 |
5 | 210022404101031223442 |
6 | 2023020314204024454 |
7 | 62163310002505420 |
oct | 5762640035526462 |
9 | 1016226846268877 |
10 | 210200002211122 |
11 | 60a81358388840 |
12 | 1b6aa20353212a |
13 | 9039a1002bb11 |
14 | 39c9a3d24c110 |
15 | 1947bb7741967 |
hex | bf2d0076ad32 |
210200002211122 has 64 divisors (see below), whose sum is σ = 397231813313280. Its totient is φ = 81037566892800.
The previous prime is 210200002211107. The next prime is 210200002211141. The reversal of 210200002211122 is 221112200002012.
It is a happy number.
210200002211122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 210200002211096 and 210200002211105.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4435972 + ... + 20978032.
It is an arithmetic number, because the mean of its divisors is an integer number (6206747083020).
Almost surely, 2210200002211122 is an apocalyptic number.
210200002211122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210200002211122 is a deficient number, since it is larger than the sum of its proper divisors (187031811102158).
210200002211122 is a wasteful number, since it uses less digits than its factorization.
210200002211122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16542947.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210200002211122 its reverse (221112200002012), we get a palindrome (431312202213134).
The spelling of 210200002211122 in words is "two hundred ten trillion, two hundred billion, two million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •