Base | Representation |
---|---|
bin | 11101101100101101011110… |
… | …001110100100001100011111 |
3 | 122010110202021212021111001121 |
4 | 131230231132032210030133 |
5 | 114110002210304041411 |
6 | 1141444030132151411 |
7 | 36340453030416463 |
oct | 3554553616441437 |
9 | 563422255244047 |
10 | 130615831315231 |
11 | 386889546a2219 |
12 | 12796281768567 |
13 | 57b6035057132 |
14 | 2437ba8c244a3 |
15 | 101793e1db571 |
hex | 76cb5e3a431f |
130615831315231 has 2 divisors, whose sum is σ = 130615831315232. Its totient is φ = 130615831315230.
The previous prime is 130615831315139. The next prime is 130615831315243. The reversal of 130615831315231 is 132513138516031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130615831315231 - 29 = 130615831314719 is a prime.
It is a super-2 number, since 2×1306158313152312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130615831315031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65307915657615 + 65307915657616.
It is an arithmetic number, because the mean of its divisors is an integer number (65307915657616).
Almost surely, 2130615831315231 is an apocalyptic number.
130615831315231 is a deficient number, since it is larger than the sum of its proper divisors (1).
130615831315231 is an equidigital number, since it uses as much as digits as its factorization.
130615831315231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 43.
The spelling of 130615831315231 in words is "one hundred thirty trillion, six hundred fifteen billion, eight hundred thirty-one million, three hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.500 sec. • engine limits •