Base | Representation |
---|---|
bin | 101110100111010001… |
… | …1010000001101111100 |
3 | 100120101021210011202020 |
4 | 1131032203100031330 |
5 | 3120002120041444 |
6 | 113553011400140 |
7 | 10142423625330 |
oct | 1351643201574 |
9 | 316337704666 |
10 | 100102112124 |
11 | 394a903a493 |
12 | 17497bb3050 |
13 | 9593a12711 |
14 | 4bb88417c0 |
15 | 290d1aa119 |
hex | 174e8d037c |
100102112124 has 24 divisors (see below), whose sum is σ = 266938965888. Its totient is φ = 28600603440.
The previous prime is 100102112107. The next prime is 100102112179. The reversal of 100102112124 is 421211201001.
It is a congruent number.
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, 595845822 + ... + 595845989.
It is an arithmetic number, because the mean of its divisors is an integer number (11122456912).
Almost surely, 2100102112124 is an apocalyptic number.
100102112124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
100102112124 is an abundant number, since it is smaller than the sum of its proper divisors (166836853764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102112124 is a wasteful number, since it uses less digits than its factorization.
100102112124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191691825 (or 1191691823 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100102112124 its reverse (421211201001), we get a palindrome (521313313125).
It can be divided in two parts, 100102 and 112124, that added together give a triangular number (212226 = T651).
The spelling of 100102112124 in words is "one hundred billion, one hundred two million, one hundred twelve thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •