Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010110001000001010100110 |
3 | 222101001011102020022211100212 |
4 | 231232122311112020022212 |
5 | 202324323344302210042 |
6 | 1551412552311535422 |
7 | 60234066030123563 |
oct | 5556326526101246 |
9 | 871034366284325 |
10 | 201102001210022 |
11 | 59093974a68020 |
12 | 1a67aab938a572 |
13 | 8829ab68461a3 |
14 | 3793562bbd86a |
15 | 183b1d0591482 |
hex | b6e6b55882a6 |
201102001210022 has 16 divisors (see below), whose sum is σ = 329144317702992. Its totient is φ = 91391023960320.
The previous prime is 201102001210009. The next prime is 201102001210051. The reversal of 201102001210022 is 220012100201102.
201102001210022 is digitally balanced in base 2 and base 3, because in such bases 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 = 201102001209979 and 201102001210006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 948721103 + ... + 948933050.
It is an arithmetic number, because the mean of its divisors is an integer number (20571519856437).
Almost surely, 2201102001210022 is an apocalyptic number.
201102001210022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201102001210022 is a deficient number, since it is larger than the sum of its proper divisors (128042316492970).
201102001210022 is a wasteful number, since it uses less digits than its factorization.
201102001210022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1897658983.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201102001210022 its reverse (220012100201102), we get a palindrome (421114101411124).
The spelling of 201102001210022 in words is "two hundred one trillion, one hundred two billion, one million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •