Base | Representation |
---|---|
bin | 101111110000000011000100… |
… | …101001111000110011011010 |
3 | 1000112120202120101200020022120 |
4 | 233300003010221320303122 |
5 | 210011301010134020442 |
6 | 2022353134342402110 |
7 | 62143503035310633 |
oct | 5760030451706332 |
9 | 1015522511606276 |
10 | 210010020220122 |
11 | 60a08827512021 |
12 | 1b679422a30336 |
13 | 9024b24364225 |
14 | 39c077985a88a |
15 | 1942c98a364ec |
hex | bf00c4a78cda |
210010020220122 has 32 divisors (see below), whose sum is σ = 422246817229824. Its totient is φ = 69632581930800.
The previous prime is 210010020220087. The next prime is 210010020220127. The reversal of 210010020220122 is 221022020010012.
It is a super-3 number, since 3×2100100202201223 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (210010020220127) 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 15 ways as a sum of consecutive naturals, for example, 44151954 + ... + 48676637.
It is an arithmetic number, because the mean of its divisors is an integer number (13195213038432).
Almost surely, 2210010020220122 is an apocalyptic number.
210010020220122 is an abundant number, since it is smaller than the sum of its proper divisors (212236797009702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010020220122 is a wasteful number, since it uses less digits than its factorization.
210010020220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92830594.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 210010020220122 its reverse (221022020010012), we get a palindrome (431032040230134).
The spelling of 210010020220122 in words is "two hundred ten trillion, ten billion, twenty million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •