Base | Representation |
---|---|
bin | 10010111000000111… |
… | …01011001111011111 |
3 | 222011021122222000210 |
4 | 21130003223033133 |
5 | 131223401331030 |
6 | 4353343223503 |
7 | 506065665363 |
oct | 113403531737 |
9 | 28137588023 |
10 | 10134402015 |
11 | 4330673261 |
12 | 1b69ba7b93 |
13 | c567b77aa |
14 | 6c1d4b2a3 |
15 | 3e4aaabb0 |
hex | 25c0eb3df |
10134402015 has 48 divisors (see below), whose sum is σ = 17315654688. Its totient is φ = 5060296704.
The previous prime is 10134401989. The next prime is 10134402121. The reversal of 10134402015 is 51020443101.
It is not a de Polignac number, because 10134402015 - 28 = 10134401759 is a prime.
It is a super-2 number, since 2×101344020152 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10134401982 and 10134402000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 830599 + ... + 842711.
It is an arithmetic number, because the mean of its divisors is an integer number (360742806).
Almost surely, 210134402015 is an apocalyptic number.
10134402015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10134402015 is a deficient number, since it is larger than the sum of its proper divisors (7181252673).
10134402015 is a wasteful number, since it uses less digits than its factorization.
10134402015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12348 (or 12331 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 10134402015 its reverse (51020443101), we get a palindrome (61154845116).
It can be divided in two parts, 1013 and 4402015, that added together give a triangular number (4403028 = T2967).
The spelling of 10134402015 in words is "ten billion, one hundred thirty-four million, four hundred two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •