Base | Representation |
---|---|
bin | 10010101001100001… |
… | …01111111111100110 |
3 | 221211202100022100100 |
4 | 21110300233333212 |
5 | 131001033001410 |
6 | 4333251524530 |
7 | 503051412021 |
oct | 112460577746 |
9 | 27752308310 |
10 | 10012000230 |
11 | 4278570a61 |
12 | 1b34bb9746 |
13 | c3732c5bb |
14 | 6ad9a81b8 |
15 | 3d8e7d8c0 |
hex | 254c2ffe6 |
10012000230 has 96 divisors (see below), whose sum is σ = 27592272864. Its totient is φ = 2510097408.
The previous prime is 10012000189. The next prime is 10012000253. The reversal of 10012000230 is 3200021001.
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 an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1669297 + ... + 1675283.
It is an arithmetic number, because the mean of its divisors is an integer number (287419509).
Almost surely, 210012000230 is an apocalyptic number.
10012000230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10012000230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13796136432).
10012000230 is an abundant number, since it is smaller than the sum of its proper divisors (17580272634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012000230 is a wasteful number, since it uses less digits than its factorization.
10012000230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7110 (or 7107 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 10012000230 its reverse (3200021001), we get a palindrome (13212021231).
The spelling of 10012000230 in words is "ten billion, twelve million, two hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •