Base | Representation |
---|---|
bin | 101111101000110001… |
… | …1100110110110010000 |
3 | 100210001110112110200210 |
4 | 1133101203212312100 |
5 | 3134002301120422 |
6 | 114555044244120 |
7 | 10251042552333 |
oct | 1372143466620 |
9 | 323043473623 |
10 | 102300020112 |
11 | 3a426770274 |
12 | 179b00a0640 |
13 | 9854190aa4 |
14 | 4d466d661a |
15 | 29db11210c |
hex | 17d18e6d90 |
102300020112 has 40 divisors (see below), whose sum is σ = 264601015840. Its totient is φ = 34057946880.
The previous prime is 102300020107. The next prime is 102300020143. The reversal of 102300020112 is 211020003201.
It is a super-2 number, since 2×1023000201122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1275037 + ... + 1352892.
It is an arithmetic number, because the mean of its divisors is an integer number (6615025396).
Almost surely, 2102300020112 is an apocalyptic number.
102300020112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102300020112 is an abundant number, since it is smaller than the sum of its proper divisors (162300995728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102300020112 is a wasteful number, since it uses less digits than its factorization.
102300020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2628751 (or 2628745 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 102300020112 its reverse (211020003201), we get a palindrome (313320023313).
The spelling of 102300020112 in words is "one hundred two billion, three hundred million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •