Base | Representation |
---|---|
bin | 100111010101… |
… | …100110100100 |
3 | 201101220112122 |
4 | 213111212210 |
5 | 10114441400 |
6 | 1005005112 |
7 | 153436301 |
oct | 47254644 |
9 | 21356478 |
10 | 10312100 |
11 | 59036a7 |
12 | 3553798 |
13 | 21a0946 |
14 | 15260a8 |
15 | d8a685 |
hex | 9d59a4 |
10312100 has 36 divisors (see below), whose sum is σ = 22620948. Its totient is φ = 4080000.
The previous prime is 10312091. The next prime is 10312121. The reversal of 10312100 is 121301.
10312100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 376996 + 9935104 = 614^2 + 3152^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9590 + ... + 10610.
Almost surely, 210312100 is an apocalyptic number.
10312100 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 10312100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11310474).
10312100 is an abundant number, since it is smaller than the sum of its proper divisors (12308848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10312100 is a wasteful number, since it uses less digits than its factorization.
10312100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1136 (or 1129 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 10312100 is about 3211.2458641468. The cubic root of 10312100 is about 217.6618779924.
Adding to 10312100 its reverse (121301), we get a palindrome (10433401).
The spelling of 10312100 in words is "ten million, three hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •