Base | Representation |
---|---|
bin | 11101100110101011010110… |
… | …101111101001010110010101 |
3 | 122002000010011101020220122002 |
4 | 131212223112233221112111 |
5 | 114031204120301102201 |
6 | 1140525342524045045 |
7 | 36265505065456304 |
oct | 3546532657512625 |
9 | 562003141226562 |
10 | 130201241425301 |
11 | 38539044499652 |
12 | 12729a58393785 |
13 | 5785c02b41037 |
14 | 2421ab90b443b |
15 | 100bc769dc76b |
hex | 766ad6be9595 |
130201241425301 has 2 divisors, whose sum is σ = 130201241425302. Its totient is φ = 130201241425300.
The previous prime is 130201241425271. The next prime is 130201241425309. The reversal of 130201241425301 is 103524142102031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79980647376100 + 50220594049201 = 8943190^2 + 7086649^2 .
It is a cyclic number.
It is not a de Polignac number, because 130201241425301 - 218 = 130201241163157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130201241425309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65100620712650 + 65100620712651.
It is an arithmetic number, because the mean of its divisors is an integer number (65100620712651).
Almost surely, 2130201241425301 is an apocalyptic number.
It is an amenable number.
130201241425301 is a deficient number, since it is larger than the sum of its proper divisors (1).
130201241425301 is an equidigital number, since it uses as much as digits as its factorization.
130201241425301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 130201241425301 its reverse (103524142102031), we get a palindrome (233725383527332).
The spelling of 130201241425301 in words is "one hundred thirty trillion, two hundred one billion, two hundred forty-one million, four hundred twenty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •