Base | Representation |
---|---|
bin | 111100100101100111… |
… | …0001100101011110101 |
3 | 110102211122212020222002 |
4 | 1321023032030223311 |
5 | 4112431411011203 |
6 | 135434442545045 |
7 | 12254162344652 |
oct | 1711316145365 |
9 | 412748766862 |
10 | 130111032053 |
11 | 501a8316162 |
12 | 21271b08185 |
13 | c366bab882 |
14 | 642412cc29 |
15 | 35b7996d88 |
hex | 1e4b38caf5 |
130111032053 has 2 divisors, whose sum is σ = 130111032054. Its totient is φ = 130111032052.
The previous prime is 130111031987. The next prime is 130111032067. The reversal of 130111032053 is 350230111031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103071176209 + 27039855844 = 321047^2 + 164438^2 .
It is a cyclic number.
It is not a de Polignac number, because 130111032053 - 220 = 130109983477 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130111032253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055516026 + 65055516027.
It is an arithmetic number, because the mean of its divisors is an integer number (65055516027).
Almost surely, 2130111032053 is an apocalyptic number.
It is an amenable number.
130111032053 is a deficient number, since it is larger than the sum of its proper divisors (1).
130111032053 is an equidigital number, since it uses as much as digits as its factorization.
130111032053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 130111032053 its reverse (350230111031), we get a palindrome (480341143084).
The spelling of 130111032053 in words is "one hundred thirty billion, one hundred eleven million, thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •