Base | Representation |
---|---|
bin | 1001100001110000… |
… | …01100000101011111 |
3 | 111012110210002100010 |
4 | 10300320030011133 |
5 | 40433420100411 |
6 | 2203320134303 |
7 | 240516544602 |
oct | 46070140537 |
9 | 14173702303 |
10 | 5115003231 |
11 | 21953166a8 |
12 | ba9007393 |
13 | 636926340 |
14 | 36747a339 |
15 | 1ee0c17a6 |
hex | 130e0c15f |
5115003231 has 32 divisors (see below), whose sum is σ = 7786957248. Its totient is φ = 2958612480.
The previous prime is 5115003227. The next prime is 5115003233. The reversal of 5115003231 is 1323005115.
It is not a de Polignac number, because 5115003231 - 22 = 5115003227 is a prime.
It is a super-2 number, since 2×51150032312 = 52326516106280878722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5115003198 and 5115003207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5115003233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 539625 + ... + 549021.
It is an arithmetic number, because the mean of its divisors is an integer number (243342414).
Almost surely, 25115003231 is an apocalyptic number.
5115003231 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5115003231 is a deficient number, since it is larger than the sum of its proper divisors (2671954017).
5115003231 is a wasteful number, since it uses less digits than its factorization.
5115003231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10251.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 5115003231 is about 71519.2507720823. The cubic root of 5115003231 is about 1722.9868813793.
Adding to 5115003231 its reverse (1323005115), we get a palindrome (6438008346).
The spelling of 5115003231 in words is "five billion, one hundred fifteen million, three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •