Base | Representation |
---|---|
bin | 10010101010110111… |
… | …11001111001101000 |
3 | 221212112122001112211 |
4 | 21111123321321220 |
5 | 131011432004000 |
6 | 4334334214504 |
7 | 503246516611 |
oct | 112533717150 |
9 | 27775561484 |
10 | 10023313000 |
11 | 4283998458 |
12 | 1b38954434 |
13 | c3979084c |
14 | 6b12b0c08 |
15 | 3d9e657ba |
hex | 2556f9e68 |
10023313000 has 64 divisors (see below), whose sum is σ = 23669989200. Its totient is φ = 3972499200.
The previous prime is 10023312997. The next prime is 10023313019. The reversal of 10023313000 is 31332001.
It can be written as a sum of positive squares in 8 ways, for example, as 810768676 + 9212544324 = 28474^2 + 95982^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63022 + ... + 154978.
Almost surely, 210023313000 is an apocalyptic number.
10023313000 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 10023313000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11834994600).
10023313000 is an abundant number, since it is smaller than the sum of its proper divisors (13646676200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10023313000 is a wasteful number, since it uses less digits than its factorization.
10023313000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92087 (or 92073 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 10023313000 its reverse (31332001), we get a palindrome (10054645001).
The spelling of 10023313000 in words is "ten billion, twenty-three million, three hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •