Base | Representation |
---|---|
bin | 11101100100001100111011… |
… | …011000010000111111111111 |
3 | 122001101212002002200012002012 |
4 | 131210030323120100333333 |
5 | 114020412224030300411 |
6 | 1140315251005321435 |
7 | 36250303434545411 |
oct | 3544147330207777 |
9 | 561355062605065 |
10 | 130031131103231 |
11 | 3848299066a916 |
12 | 12700aa286627b |
13 | 5772b6309b127 |
14 | 241777c9209b1 |
15 | 100761c64e18b |
hex | 76433b610fff |
130031131103231 has 2 divisors, whose sum is σ = 130031131103232. Its totient is φ = 130031131103230.
The previous prime is 130031131103219. The next prime is 130031131103407. The reversal of 130031131103231 is 132301131130031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130031131103231 - 222 = 130031126908927 is a prime.
It is a super-2 number, since 2×1300311311032312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130031131103197 and 130031131103206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130031131108231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65015565551615 + 65015565551616.
It is an arithmetic number, because the mean of its divisors is an integer number (65015565551616).
Almost surely, 2130031131103231 is an apocalyptic number.
130031131103231 is a deficient number, since it is larger than the sum of its proper divisors (1).
130031131103231 is an equidigital number, since it uses as much as digits as its factorization.
130031131103231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 130031131103231 its reverse (132301131130031), we get a palindrome (262332262233262).
The spelling of 130031131103231 in words is "one hundred thirty trillion, thirty-one billion, one hundred thirty-one million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •