Base | Representation |
---|---|
bin | 111111011110110… |
… | …1100100000011100 |
3 | 12111110011102000210 |
4 | 1332331230200130 |
5 | 13330301233200 |
6 | 551211252420 |
7 | 103533366534 |
oct | 17675544034 |
9 | 5443142023 |
10 | 2130102300 |
11 | 9a3429427 |
12 | 4b544a110 |
13 | 27c3ca581 |
14 | 162c844c4 |
15 | c7011650 |
hex | 7ef6c81c |
2130102300 has 72 divisors (see below), whose sum is σ = 6185586736. Its totient is φ = 565954560.
The previous prime is 2130102283. The next prime is 2130102323. The reversal of 2130102300 is 32010312.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70284 + ... + 95916.
Almost surely, 22130102300 is an apocalyptic number.
2130102300 is a gapful number since it is divisible by the number (20) 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 2130102300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3092793368).
2130102300 is an abundant number, since it is smaller than the sum of its proper divisors (4055484436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130102300 is a wasteful number, since it uses less digits than its factorization.
2130102300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25927 (or 25920 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 2130102300 is about 46153.0313197302. The cubic root of 2130102300 is about 1286.6689493488.
Adding to 2130102300 its reverse (32010312), we get a palindrome (2162112612).
The spelling of 2130102300 in words is "two billion, one hundred thirty million, one hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •