Base | Representation |
---|---|
bin | 10111001100010011000110… |
… | …010010100011111100100010 |
3 | 111101011010101000111120021100 |
4 | 113030103012102203330202 |
5 | 101332132412241200002 |
6 | 1000534125530535230 |
7 | 30325162202361624 |
oct | 2714230622437442 |
9 | 441133330446240 |
10 | 102000210100002 |
11 | 2a556056509225 |
12 | b5343a7b97516 |
13 | 44bb76a08c836 |
14 | 1b28b9d552c14 |
15 | bbd3d5e4e11c |
hex | 5cc4c64a3f22 |
102000210100002 has 96 divisors (see below), whose sum is σ = 229366641816000. Its totient is φ = 32720726666880.
The previous prime is 102000210099979. The next prime is 102000210100021. The reversal of 102000210100002 is 200001012000201.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 296089477 + ... + 296433767.
It is an arithmetic number, because the mean of its divisors is an integer number (2389235852250).
Almost surely, 2102000210100002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102000210100002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114683320908000).
102000210100002 is an abundant number, since it is smaller than the sum of its proper divisors (127366431715998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000210100002 is a wasteful number, since it uses less digits than its factorization.
102000210100002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346176 (or 346173 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102000210100002 its reverse (200001012000201), we get a palindrome (302001222100203).
The spelling of 102000210100002 in words is "one hundred two trillion, two hundred ten million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •