Base | Representation |
---|---|
bin | 11101100101010110100000… |
… | …000110000001011011011001 |
3 | 122001200101222200110200111022 |
4 | 131211112200012001123121 |
5 | 114023211021314343001 |
6 | 1140415434011012225 |
7 | 36256101214214234 |
oct | 3545264006013331 |
9 | 561611880420438 |
10 | 130110130231001 |
11 | 3850343a607868 |
12 | 1271426b43a075 |
13 | 577a442a4ba4b |
14 | 241b5147a241b |
15 | 10096e2d1811b |
hex | 7655a01816d9 |
130110130231001 has 2 divisors, whose sum is σ = 130110130231002. Its totient is φ = 130110130231000.
The previous prime is 130110130230979. The next prime is 130110130231007. The reversal of 130110130231001 is 100132031011031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125685624121600 + 4424506109401 = 11210960^2 + 2103451^2 .
It is a cyclic number.
It is not a de Polignac number, because 130110130231001 - 222 = 130110126036697 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (130110130231007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055065115500 + 65055065115501.
It is an arithmetic number, because the mean of its divisors is an integer number (65055065115501).
Almost surely, 2130110130231001 is an apocalyptic number.
It is an amenable number.
130110130231001 is a deficient number, since it is larger than the sum of its proper divisors (1).
130110130231001 is an equidigital number, since it uses as much as digits as its factorization.
130110130231001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 130110130231001 its reverse (100132031011031), we get a palindrome (230242161242032).
The spelling of 130110130231001 in words is "one hundred thirty trillion, one hundred ten billion, one hundred thirty million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •