Base | Representation |
---|---|
bin | 10111001100010011000110… |
… | …010010001110011101101100 |
3 | 111101011010101000100002120110 |
4 | 113030103012102032131230 |
5 | 101332132412230341022 |
6 | 1000534125525020020 |
7 | 30325162201544244 |
oct | 2714230622163554 |
9 | 441133330302513 |
10 | 102000210012012 |
11 | 2a556056459104 |
12 | b5343a7b54610 |
13 | 44bb76a05b780 |
14 | 1b28b9d52cb24 |
15 | bbd3d5e3300c |
hex | 5cc4c648e76c |
102000210012012 has 24 divisors (see below), whose sum is σ = 256308220030576. Its totient is φ = 31384680003648.
The previous prime is 102000210011989. The next prime is 102000210012017. The reversal of 102000210012012 is 210210012000201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (102000210012017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 326923749883 + ... + 326923750194.
Almost surely, 2102000210012012 is an apocalyptic number.
102000210012012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102000210012012 is an abundant number, since it is smaller than the sum of its proper divisors (154308010018564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000210012012 is a wasteful number, since it uses less digits than its factorization.
102000210012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 653847500097 (or 653847500095 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102000210012012 its reverse (210210012000201), we get a palindrome (312210222012213).
The spelling of 102000210012012 in words is "one hundred two trillion, two hundred ten million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •