Base | Representation |
---|---|
bin | 10010101000011000… |
… | …01111100010100001 |
3 | 221211002100002121120 |
4 | 21110030033202201 |
5 | 130441110230423 |
6 | 4332310442453 |
7 | 502604152554 |
oct | 112414174241 |
9 | 27732302546 |
10 | 10002430113 |
11 | 4273124875 |
12 | 1b31963429 |
13 | c3535b600 |
14 | 6ac5d669b |
15 | 3d81dcee3 |
hex | 25430f8a1 |
10002430113 has 36 divisors (see below), whose sum is σ = 14843264688. Its totient is φ = 5988565440.
The previous prime is 10002430103. The next prime is 10002430121. The reversal of 10002430113 is 31103420001.
10002430113 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10002430113 - 218 = 10002167969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002430092 and 10002430101.
It is not an unprimeable number, because it can be changed into a prime (10002430103) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 686878 + ... + 701288.
It is an arithmetic number, because the mean of its divisors is an integer number (412312908).
Almost surely, 210002430113 is an apocalyptic number.
10002430113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10002430113 is a deficient number, since it is larger than the sum of its proper divisors (4840834575).
10002430113 is a wasteful number, since it uses less digits than its factorization.
10002430113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14514 (or 14464 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10002430113 its reverse (31103420001), we get a palindrome (41105850114).
The spelling of 10002430113 in words is "ten billion, two million, four hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •