Base | Representation |
---|---|
bin | 10010111010011010… |
… | …00001100110111001 |
3 | 222012121211212001110 |
4 | 21131031001212321 |
5 | 131243312131022 |
6 | 4355311310533 |
7 | 506421301140 |
oct | 113515014671 |
9 | 28177755043 |
10 | 10153630137 |
11 | 4340506672 |
12 | 1b7451b449 |
13 | c5a78a791 |
14 | 6c4714757 |
15 | 3e660800c |
hex | 25d3419b9 |
10153630137 has 32 divisors (see below), whose sum is σ = 16507459584. Its totient is φ = 5419065600.
The previous prime is 10153630111. The next prime is 10153630139. The reversal of 10153630137 is 73103635101.
10153630137 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 10153630137 - 216 = 10153564601 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10153630139) 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 31 ways as a sum of consecutive naturals, for example, 61789 + ... + 155322.
It is an arithmetic number, because the mean of its divisors is an integer number (515858112).
Almost surely, 210153630137 is an apocalyptic number.
10153630137 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
10153630137 is a deficient number, since it is larger than the sum of its proper divisors (6353829447).
10153630137 is a wasteful number, since it uses less digits than its factorization.
10153630137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217269.
The product of its (nonzero) digits is 5670, while the sum is 30.
The spelling of 10153630137 in words is "ten billion, one hundred fifty-three million, six hundred thirty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •