Base | Representation |
---|---|
bin | 11101101010001011111101… |
… | …110000000010111010010001 |
3 | 122002212011200010000121102221 |
4 | 131222023331300002322101 |
5 | 114044132030441310001 |
6 | 1141232230121341041 |
7 | 36322103422560352 |
oct | 3552137560027221 |
9 | 562764603017387 |
10 | 130442414010001 |
11 | 3862135409a055 |
12 | 12768744637781 |
13 | 57a2889128562 |
14 | 242d637397d29 |
15 | 101318e86b1a1 |
hex | 76a2fdc02e91 |
130442414010001 has 2 divisors, whose sum is σ = 130442414010002. Its totient is φ = 130442414010000.
The previous prime is 130442414009977. The next prime is 130442414010011. The reversal of 130442414010001 is 100010414244031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118435662324225 + 12006751685776 = 10882815^2 + 3465076^2 .
It is an emirp because it is prime and its reverse (100010414244031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130442414010001 - 211 = 130442414007953 is a prime.
It is not a weakly prime, because it can be changed into another prime (130442414010011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65221207005000 + 65221207005001.
It is an arithmetic number, because the mean of its divisors is an integer number (65221207005001).
Almost surely, 2130442414010001 is an apocalyptic number.
It is an amenable number.
130442414010001 is a deficient number, since it is larger than the sum of its proper divisors (1).
130442414010001 is an equidigital number, since it uses as much as digits as its factorization.
130442414010001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 130442414010001 its reverse (100010414244031), we get a palindrome (230452828254032).
The spelling of 130442414010001 in words is "one hundred thirty trillion, four hundred forty-two billion, four hundred fourteen million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •