Base | Representation |
---|---|
bin | 11101100101100000110100… |
… | …101100010010000101111101 |
3 | 122001201110121002002000202022 |
4 | 131211200310230102011331 |
5 | 114023401221041121133 |
6 | 1140424505442005525 |
7 | 36256642652125145 |
oct | 3545406454220575 |
9 | 561643532060668 |
10 | 130121213223293 |
11 | 3850810767aa26 |
12 | 127164430468a5 |
13 | 577b4bac13756 |
14 | 241bc866b7925 |
15 | 1009b40cec998 |
hex | 765834b1217d |
130121213223293 has 2 divisors, whose sum is σ = 130121213223294. Its totient is φ = 130121213223292.
The previous prime is 130121213223251. The next prime is 130121213223307. The reversal of 130121213223293 is 392322312121031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105089623250329 + 25031589972964 = 10251323^2 + 5003158^2 .
It is a cyclic number.
It is not a de Polignac number, because 130121213223293 - 228 = 130120944787837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130121213223593) 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, 65060606611646 + 65060606611647.
It is an arithmetic number, because the mean of its divisors is an integer number (65060606611647).
Almost surely, 2130121213223293 is an apocalyptic number.
It is an amenable number.
130121213223293 is a deficient number, since it is larger than the sum of its proper divisors (1).
130121213223293 is an equidigital number, since it uses as much as digits as its factorization.
130121213223293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 130121213223293 in words is "one hundred thirty trillion, one hundred twenty-one billion, two hundred thirteen million, two hundred twenty-three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •