Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …0110110101000001100000 |
3 | 1022202122222210000001110022 |
4 | 2102333133012311001200 |
5 | 2310444240033101422 |
6 | 33252233220453012 |
7 | 2061534300500513 |
oct | 222773706650140 |
9 | 38678883001408 |
10 | 10101211222112 |
11 | 324499944022a |
12 | 117182324a168 |
13 | 58370388b32a |
14 | 26cc88da0d7a |
15 | 127b50683342 |
hex | 92fdf1b5060 |
10101211222112 has 48 divisors (see below), whose sum is σ = 20216745232992. Its totient is φ = 4966832286720.
The previous prime is 10101211222093. The next prime is 10101211222127. The reversal of 10101211222112 is 21122211210101.
10101211222112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 9474533 + ... + 10486619.
It is an arithmetic number, because the mean of its divisors is an integer number (421182192354).
Almost surely, 210101211222112 is an apocalyptic number.
It is an amenable number.
10101211222112 is an abundant number, since it is smaller than the sum of its proper divisors (10115534010880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101211222112 is a wasteful number, since it uses less digits than its factorization.
10101211222112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1017271 (or 1017263 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10101211222112 its reverse (21122211210101), we get a palindrome (31223422432213).
It can be divided in two parts, 10101 and 211222112, that multiplied together give a palindrome (2133554553312).
The spelling of 10101211222112 in words is "ten trillion, one hundred one billion, two hundred eleven million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •