Base | Representation |
---|---|
bin | 1001001100100011001110… |
… | …1011101111111010000110 |
3 | 1022210121211022111210212100 |
4 | 2103020303223233322012 |
5 | 2311130234322334342 |
6 | 33301010322132530 |
7 | 2062340313645423 |
oct | 223106353577206 |
9 | 38717738453770 |
10 | 10111220121222 |
11 | 3249165183280 |
12 | 11737571b1146 |
13 | 58463a37323c |
14 | 26d55839cd4a |
15 | 1280391ece4c |
hex | 93233aefe86 |
10111220121222 has 48 divisors (see below), whose sum is σ = 24024374599680. Its totient is φ = 3047964169200.
The previous prime is 10111220121181. The next prime is 10111220121293. The reversal of 10111220121222 is 22212102211101.
10111220121222 is a `hidden beast` number, since 101 + 1 + 1 + 220 + 121 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10111220121195 and 10111220121204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 133644822 + ... + 133720457.
It is an arithmetic number, because the mean of its divisors is an integer number (500507804160).
Almost surely, 210111220121222 is an apocalyptic number.
10111220121222 is an abundant number, since it is smaller than the sum of its proper divisors (13913154478458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111220121222 is a wasteful number, since it uses less digits than its factorization.
10111220121222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267365489 (or 267365486 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10111220121222 its reverse (22212102211101), we get a palindrome (32323322332323).
The spelling of 10111220121222 in words is "ten trillion, one hundred eleven billion, two hundred twenty million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •