Base | Representation |
---|---|
bin | 101111110000001110011011… |
… | …001110100101111101101101 |
3 | 1000112121221000221002100101212 |
4 | 233300032123032211331231 |
5 | 210012000441241213401 |
6 | 2022402512114044205 |
7 | 62144414103505346 |
oct | 5760163316457555 |
9 | 1015557027070355 |
10 | 210022210101101 |
11 | 60a12a12375022 |
12 | 1b67b865279665 |
13 | 902601794c258 |
14 | 39c11b47850cd |
15 | 194325dcb2dbb |
hex | bf039b3a5f6d |
210022210101101 has 16 divisors (see below), whose sum is σ = 212817856204800. Its totient is φ = 207244742218800.
The previous prime is 210022210101047. The next prime is 210022210101149. The reversal of 210022210101101 is 101101012220012.
It is a cyclic number.
It is not a de Polignac number, because 210022210101101 - 230 = 210021136359277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210022210101161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 517809140 + ... + 518214578.
It is an arithmetic number, because the mean of its divisors is an integer number (13301116012800).
Almost surely, 2210022210101101 is an apocalyptic number.
It is an amenable number.
210022210101101 is a deficient number, since it is larger than the sum of its proper divisors (2795646103699).
210022210101101 is a wasteful number, since it uses less digits than its factorization.
210022210101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427840.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210022210101101 its reverse (101101012220012), we get a palindrome (311123222321113).
The spelling of 210022210101101 in words is "two hundred ten trillion, twenty-two billion, two hundred ten million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •