Base | Representation |
---|---|
bin | 11101100010110100111… |
… | …11000001110100101111 |
3 | 10121001020011212121122111 |
4 | 32301122133001310233 |
5 | 113112441333141411 |
6 | 2054202222424451 |
7 | 133224606510013 |
oct | 16613237016457 |
9 | 3531204777574 |
10 | 1015130365231 |
11 | 361572699274 |
12 | 1448a5132127 |
13 | 74959b2a688 |
14 | 371bdac4543 |
15 | 1b614c2c721 |
hex | ec5a7c1d2f |
1015130365231 has 2 divisors, whose sum is σ = 1015130365232. Its totient is φ = 1015130365230.
The previous prime is 1015130365219. The next prime is 1015130365243. The reversal of 1015130365231 is 1325630315101.
It is a balanced prime because it is at equal distance from previous prime (1015130365219) and next prime (1015130365243).
It is a cyclic number.
It is not a de Polignac number, because 1015130365231 - 25 = 1015130365199 is a prime.
It is a super-2 number, since 2×10151303652312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1015130365193 and 1015130365202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1015130365211) 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 as a sum of consecutive naturals, namely, 507565182615 + 507565182616.
It is an arithmetic number, because the mean of its divisors is an integer number (507565182616).
Almost surely, 21015130365231 is an apocalyptic number.
1015130365231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1015130365231 is an equidigital number, since it uses as much as digits as its factorization.
1015130365231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 31.
The spelling of 1015130365231 in words is "one trillion, fifteen billion, one hundred thirty million, three hundred sixty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •