Base | Representation |
---|---|
bin | 100111001100001… |
… | …0110001011001011 |
3 | 10101122102011220202 |
4 | 1032120112023023 |
5 | 10143120131011 |
6 | 334253042415 |
7 | 44405234126 |
oct | 11630261313 |
9 | 3348364822 |
10 | 1315005131 |
11 | 615316900 |
12 | 30848640b |
13 | 17c58ca5b |
14 | c69093bd |
15 | 7a6a623b |
hex | 4e6162cb |
1315005131 has 24 divisors (see below), whose sum is σ = 1535626512. Its totient is φ = 1121331200.
The previous prime is 1315005113. The next prime is 1315005179.
1315005131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1315005131 - 218 = 1314742987 is a prime.
It is a super-2 number, since 2×13150051312 = 3458476989112654322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1315001131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 725216 + ... + 727026.
It is an arithmetic number, because the mean of its divisors is an integer number (63984438).
Almost surely, 21315005131 is an apocalyptic number.
1315005131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1315005131 is a deficient number, since it is larger than the sum of its proper divisors (220621381).
1315005131 is a wasteful number, since it uses less digits than its factorization.
1315005131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2203 (or 2192 counting only the distinct ones).
The product of its (nonzero) digits is 225, while the sum is 20.
The square root of 1315005131 is about 36262.9994760500. Note that the first 3 decimals coincide. The cubic root of 1315005131 is about 1095.5759307734.
It can be divided in two parts, 131500 and 5131, that added together give a palindrome (136631).
The spelling of 1315005131 in words is "one billion, three hundred fifteen million, five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •