Base | Representation |
---|---|
bin | 101111100110000110… |
… | …0101000101011010100 |
3 | 100202211012100200020120 |
4 | 1133030030220223110 |
5 | 3133311242042322 |
6 | 114542113231540 |
7 | 10245601422225 |
oct | 1371414505324 |
9 | 322735320216 |
10 | 102210112212 |
11 | 3a38aa4211a |
12 | 17985b625b0 |
13 | 983b671a50 |
14 | 4d387b124c |
15 | 29d32a2a5c |
hex | 17cc328ad4 |
102210112212 has 48 divisors (see below), whose sum is σ = 265692080640. Its totient is φ = 30364806528.
The previous prime is 102210112177. The next prime is 102210112253. The reversal of 102210112212 is 212211012201.
It is a super-3 number, since 3×1022101122123 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102210112191 and 102210112200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11291908 + ... + 11300955.
It is an arithmetic number, because the mean of its divisors is an integer number (5535251680).
Almost surely, 2102210112212 is an apocalyptic number.
102210112212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102210112212 is an abundant number, since it is smaller than the sum of its proper divisors (163481968428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102210112212 is a wasteful number, since it uses less digits than its factorization.
102210112212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22592912 (or 22592910 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102210112212 its reverse (212211012201), we get a palindrome (314421124413).
The spelling of 102210112212 in words is "one hundred two billion, two hundred ten million, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •