Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …110100111111000100011000 |
3 | 111101212020001212121110012120 |
4 | 113033031022310333010120 |
5 | 101343421101031241440 |
6 | 1001210011033141240 |
7 | 30345464220326541 |
oct | 2717151264770430 |
9 | 441766055543176 |
10 | 102200002212120 |
11 | 2a62286099a15a |
12 | b567065b5a820 |
13 | 450455a2c2317 |
14 | 1b34713b9b4c8 |
15 | bc36cb00bdd0 |
hex | 5cf34ad3f118 |
102200002212120 has 32 divisors (see below), whose sum is σ = 306600006636720. Its totient is φ = 27253333923200.
The previous prime is 102200002212079. The next prime is 102200002212137. The reversal of 102200002212120 is 21212200002201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 102200002212120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 425833342431 + ... + 425833342670.
Almost surely, 2102200002212120 is an apocalyptic number.
102200002212120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102200002212120 is an abundant number, since it is smaller than the sum of its proper divisors (204400004424600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102200002212120 is a wasteful number, since it uses less digits than its factorization.
102200002212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851666685115 (or 851666685111 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102200002212120 its reverse (21212200002201), we get a palindrome (123412202214321).
The spelling of 102200002212120 in words is "one hundred two trillion, two hundred billion, two million, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •