Base | Representation |
---|---|
bin | 11101101111110100000… |
… | …10100000111001110100 |
3 | 10121201020001122010202100 |
4 | 32313322002200321310 |
5 | 113221231131242322 |
6 | 2101314113342100 |
7 | 133562434312344 |
oct | 16677202407164 |
9 | 3551201563670 |
10 | 1022102212212 |
11 | 364520064084 |
12 | 14610bb67930 |
13 | 754cb357213 |
14 | 376819d2d24 |
15 | 1b8c1d34dac |
hex | edfa0a0e74 |
1022102212212 has 36 divisors (see below), whose sum is σ = 2583709893856. Its totient is φ = 340692477840.
The previous prime is 1022102212207. The next prime is 1022102212223. The reversal of 1022102212212 is 2122122012201.
It is a happy number.
1022102212212 is a `hidden beast` number, since 1 + 0 + 221 + 0 + 221 + 221 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1264443 + ... + 1908669.
Almost surely, 21022102212212 is an apocalyptic number.
1022102212212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022102212212 is an abundant number, since it is smaller than the sum of its proper divisors (1561607681644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022102212212 is a wasteful number, since it uses less digits than its factorization.
1022102212212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688308 (or 688303 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1022102212212 its reverse (2122122012201), we get a palindrome (3144224224413).
The spelling of 1022102212212 in words is "one trillion, twenty-two billion, one hundred two million, two hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •