Base | Representation |
---|---|
bin | 10010101000001101… |
… | …11000000000011000 |
3 | 221210222200121102021 |
4 | 21110012320000120 |
5 | 130440230214000 |
6 | 4332220344224 |
7 | 502556202313 |
oct | 112406700030 |
9 | 27728617367 |
10 | 10001023000 |
11 | 4272353671 |
12 | 1b313a5074 |
13 | c34c87cb7 |
14 | 6ac34b97a |
15 | 3d801111a |
hex | 2541b8018 |
10001023000 has 64 divisors (see below), whose sum is σ = 23751842400. Its totient is φ = 3940675200.
The previous prime is 10001022971. The next prime is 10001023013. The reversal of 10001023000 is 32010001.
It is a super-2 number, since 2×100010230002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7635 + ... + 141634.
Almost surely, 210001023000 is an apocalyptic number.
10001023000 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 10001023000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11875921200).
10001023000 is an abundant number, since it is smaller than the sum of its proper divisors (13750819400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001023000 is a wasteful number, since it uses less digits than its factorization.
10001023000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149357 (or 149343 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 7.
Adding to 10001023000 its reverse (32010001), we get a palindrome (10033033001).
The spelling of 10001023000 in words is "ten billion, one million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •