Base | Representation |
---|---|
bin | 10111001110000011101101… |
… | …001101101000001010111100 |
3 | 111101120200110120221202220101 |
4 | 113032003231031220022330 |
5 | 101341123024240433200 |
6 | 1001105443524530444 |
7 | 30340002415316455 |
oct | 2716035515501274 |
9 | 441520416852811 |
10 | 102121122202300 |
11 | 2a5a23632112a3 |
12 | b553911250a24 |
13 | 44c9c99219cb6 |
14 | 1b3098da8612c |
15 | bc161102226a |
hex | 5ce0ed3682bc |
102121122202300 has 36 divisors (see below), whose sum is σ = 221603455517976. Its totient is φ = 40848334532800.
The previous prime is 102121122202237. The next prime is 102121122202301. The reversal of 102121122202300 is 3202221121201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102121122202301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40629195 + ... + 43069405.
It is an arithmetic number, because the mean of its divisors is an integer number (6155651542166).
Almost surely, 2102121122202300 is an apocalyptic number.
102121122202300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102121122202300 is an abundant number, since it is smaller than the sum of its proper divisors (119482333315676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121122202300 is a wasteful number, since it uses less digits than its factorization.
102121122202300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2858718 (or 2858711 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102121122202300 its reverse (3202221121201), we get a palindrome (105323343323501).
The spelling of 102121122202300 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred twenty-two million, two hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •