Base | Representation |
---|---|
bin | 10011001101000011… |
… | …00010011110101101 |
3 | 222121112002101202100 |
4 | 21212201202132231 |
5 | 132103330040410 |
6 | 4423015045313 |
7 | 513330401430 |
oct | 114641423655 |
9 | 28545071670 |
10 | 10310002605 |
11 | 4410800611 |
12 | 1bb8970839 |
13 | c83cab076 |
14 | 6db3bb817 |
15 | 4051e58c0 |
hex | 2668627ad |
10310002605 has 48 divisors (see below), whose sum is σ = 20431532160. Its totient is φ = 4711319424.
The previous prime is 10310002589. The next prime is 10310002607. The reversal of 10310002605 is 50620001301.
10310002605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10310002605 - 24 = 10310002589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310002607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1133566 + ... + 1142624.
It is an arithmetic number, because the mean of its divisors is an integer number (425656920).
Almost surely, 210310002605 is an apocalyptic number.
10310002605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10310002605 is a deficient number, since it is larger than the sum of its proper divisors (10121529555).
10310002605 is a wasteful number, since it uses less digits than its factorization.
10310002605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12690 (or 12687 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 10310002605 its reverse (50620001301), we get a palindrome (60930003906).
The spelling of 10310002605 in words is "ten billion, three hundred ten million, two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •