Base | Representation |
---|---|
bin | 10111001100010010111001… |
… | …110001000110100001000000 |
3 | 111101011002211101011111011000 |
4 | 113030102321301012201000 |
5 | 101332132000000031422 |
6 | 1000534053023452000 |
7 | 30325154041516422 |
oct | 2714227161064100 |
9 | 441132741144130 |
10 | 102000000002112 |
11 | 2a555a58959603 |
12 | b534349757000 |
13 | 44bb7356ab264 |
14 | 1b28b7d6a2812 |
15 | bbd3c279ccac |
hex | 5cc4b9c46840 |
102000000002112 has 56 divisors (see below), whose sum is σ = 299861111122400. Its totient is φ = 34000000000128.
The previous prime is 102000000002093. The next prime is 102000000002123. The reversal of 102000000002112 is 211200000000201.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102000000002094 and 102000000002103.
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, 29513887162 + ... + 29513890617.
Almost surely, 2102000000002112 is an apocalyptic number.
102000000002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102000000002112 is an abundant number, since it is smaller than the sum of its proper divisors (197861111120288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000000002112 is an equidigital number, since it uses as much as digits as its factorization.
102000000002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59027777800 (or 59027777784 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102000000002112 its reverse (211200000000201), we get a palindrome (313200000002313).
The spelling of 102000000002112 in words is "one hundred two trillion, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •