Base | Representation |
---|---|
bin | 10010101011110101… |
… | …01010011010001111 |
3 | 221220002210200221000 |
4 | 21111322222122033 |
5 | 131021013013030 |
6 | 4335223111343 |
7 | 503405201133 |
oct | 112572523217 |
9 | 27802720830 |
10 | 10031376015 |
11 | 42884a5301 |
12 | 1b3b5a2553 |
13 | c3b35486b |
14 | 6b23ad3c3 |
15 | 3daa09860 |
hex | 255eaa68f |
10031376015 has 32 divisors (see below), whose sum is σ = 17842357440. Its totient is φ = 5347427328.
The previous prime is 10031376001. The next prime is 10031376023. The reversal of 10031376015 is 51067313001.
It is not a de Polignac number, because 10031376015 - 26 = 10031375951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 10031376015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 273399 + ... + 307911.
It is an arithmetic number, because the mean of its divisors is an integer number (557573670).
Almost surely, 210031376015 is an apocalyptic number.
10031376015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10031376015 is a deficient number, since it is larger than the sum of its proper divisors (7810981425).
10031376015 is a wasteful number, since it uses less digits than its factorization.
10031376015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36680 (or 36674 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
Adding to 10031376015 its reverse (51067313001), we get a palindrome (61098689016).
The spelling of 10031376015 in words is "ten billion, thirty-one million, three hundred seventy-six thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •