Base | Representation |
---|---|
bin | 10010110101110100… |
… | …11011111110111101 |
3 | 222002221112112221100 |
4 | 21122322123332331 |
5 | 131203442444010 |
6 | 4351415523313 |
7 | 505443543525 |
oct | 113272337675 |
9 | 28087475840 |
10 | 10115203005 |
11 | 432084a806 |
12 | 1b63689539 |
13 | c52824b2b |
14 | 6bd590685 |
15 | 3e30672c0 |
hex | 25ae9bfbd |
10115203005 has 48 divisors (see below), whose sum is σ = 18789863040. Its totient is φ = 5020735104.
The previous prime is 10115203003. The next prime is 10115203009. The reversal of 10115203005 is 50030251101.
It is not a de Polignac number, because 10115203005 - 21 = 10115203003 is a prime.
It is a super-2 number, since 2×101152030052 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10115203003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 93775 + ... + 170364.
It is an arithmetic number, because the mean of its divisors is an integer number (391455480).
Almost surely, 210115203005 is an apocalyptic number.
10115203005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10115203005 is a deficient number, since it is larger than the sum of its proper divisors (8674660035).
10115203005 is a wasteful number, since it uses less digits than its factorization.
10115203005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264210 (or 264207 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
Adding to 10115203005 its reverse (50030251101), we get a palindrome (60145454106).
The spelling of 10115203005 in words is "ten billion, one hundred fifteen million, two hundred three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •