Base | Representation |
---|---|
bin | 11101100110101010011001… |
… | …010101101001110000100001 |
3 | 122002000000111120201002122121 |
4 | 131212222121111221300201 |
5 | 114031200013031413212 |
6 | 1140525052402504241 |
7 | 36265440415634134 |
oct | 3546523125516041 |
9 | 562000446632577 |
10 | 130200211201057 |
11 | 38538665a01958 |
12 | 1272980b365081 |
13 | 5785a9a580aaa |
14 | 2421a1c33a21b |
15 | 100bc1633ad07 |
hex | 766a99569c21 |
130200211201057 has 2 divisors, whose sum is σ = 130200211201058. Its totient is φ = 130200211201056.
The previous prime is 130200211201013. The next prime is 130200211201163. The reversal of 130200211201057 is 750102112002031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118588637005281 + 11611574195776 = 10889841^2 + 3407576^2 .
It is a cyclic number.
It is not a de Polignac number, because 130200211201057 - 219 = 130200210676769 is a prime.
It is not a weakly prime, because it can be changed into another prime (130200211201457) 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, 65100105600528 + 65100105600529.
It is an arithmetic number, because the mean of its divisors is an integer number (65100105600529).
Almost surely, 2130200211201057 is an apocalyptic number.
It is an amenable number.
130200211201057 is a deficient number, since it is larger than the sum of its proper divisors (1).
130200211201057 is an equidigital number, since it uses as much as digits as its factorization.
130200211201057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 130200211201057 its reverse (750102112002031), we get a palindrome (880302323203088).
The spelling of 130200211201057 in words is "one hundred thirty trillion, two hundred billion, two hundred eleven million, two hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •