Base | Representation |
---|---|
bin | 10111001101110010000110… |
… | …001001101000011001001000 |
3 | 111101111212122210101120022110 |
4 | 113031302012021220121020 |
5 | 101340320313041412300 |
6 | 1001053035332022320 |
7 | 30335433011605656 |
oct | 2715620611503110 |
9 | 441455583346273 |
10 | 102102213232200 |
11 | 2a59533a630185 |
12 | b5501147619a0 |
13 | 44c82748a21ac |
14 | 1b2dab8645dd6 |
15 | bc0da5e69550 |
hex | 5cdc86268648 |
102102213232200 has 48 divisors (see below), whose sum is σ = 316516861021680. Its totient is φ = 27227256861760.
The previous prime is 102102213232163. The next prime is 102102213232223. The reversal of 102102213232200 is 2232312201201.
It is a super-2 number, since 2×1021022132322002 (a number of 29 digits) contains 22 as substring.
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, 85085177094 + ... + 85085178293.
It is an arithmetic number, because the mean of its divisors is an integer number (6594101271285).
Almost surely, 2102102213232200 is an apocalyptic number.
102102213232200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102102213232200 is an abundant number, since it is smaller than the sum of its proper divisors (214414647789480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102213232200 is a wasteful number, since it uses less digits than its factorization.
102102213232200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170170355406 (or 170170355397 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 102102213232200 its reverse (2232312201201), we get a palindrome (104334525433401).
The spelling of 102102213232200 in words is "one hundred two trillion, one hundred two billion, two hundred thirteen million, two hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •