Base | Representation |
---|---|
bin | 10010101000010101… |
… | …11111100000011100 |
3 | 221211001201102221100 |
4 | 21110022333200130 |
5 | 130441014233200 |
6 | 4332255433100 |
7 | 502601316051 |
oct | 112412774034 |
9 | 27731642840 |
10 | 10002102300 |
11 | 4272a20553 |
12 | 1b31825790 |
13 | c35275338 |
14 | 6ac54d028 |
15 | 3d8175d00 |
hex | 2542bf81c |
10002102300 has 108 divisors (see below), whose sum is σ = 31780708960. Its totient is φ = 2630672640.
The previous prime is 10002102281. The next prime is 10002102307. The reversal of 10002102300 is 320120001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002102307) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 10420 + ... + 141819.
Almost surely, 210002102300 is an apocalyptic number.
10002102300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10002102300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15890354480).
10002102300 is an abundant number, since it is smaller than the sum of its proper divisors (21778606660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002102300 is a wasteful number, since it uses less digits than its factorization.
10002102300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152332 (or 152322 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 10002102300 its reverse (320120001), we get a palindrome (10322222301).
The spelling of 10002102300 in words is "ten billion, two million, one hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •