Base | Representation |
---|---|
bin | 10111001101111011010011… |
… | …100100010010111001111100 |
3 | 111101112211011221212010200220 |
4 | 113031323103210102321330 |
5 | 101341001041103033200 |
6 | 1001101352502421340 |
7 | 30336233036014335 |
oct | 2715732344227174 |
9 | 441484157763626 |
10 | 102112102002300 |
11 | 2a599554583555 |
12 | b552014431850 |
13 | 44c918c516550 |
14 | 1b30375ad328c |
15 | bc12841a54a0 |
hex | 5cded3912e7c |
102112102002300 has 72 divisors (see below), whose sum is σ = 318170836815216. Its totient is φ = 25135286645760.
The previous prime is 102112102002283. The next prime is 102112102002319. The reversal of 102112102002300 is 3200201211201.
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 102112102002300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13091291229 + ... + 13091299028.
Almost surely, 2102112102002300 is an apocalyptic number.
102112102002300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102112102002300 is an abundant number, since it is smaller than the sum of its proper divisors (216058734812916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102112102002300 is a wasteful number, since it uses less digits than its factorization.
102112102002300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26182590287 (or 26182590280 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102112102002300 its reverse (3200201211201), we get a palindrome (105312303213501).
The spelling of 102112102002300 in words is "one hundred two trillion, one hundred twelve billion, one hundred two million, two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •