Base | Representation |
---|---|
bin | 111100100011010000… |
… | …1101000011100100101 |
3 | 110102122011121020011111 |
4 | 1321012201220130211 |
5 | 4112301223143141 |
6 | 135422550105021 |
7 | 12252214543516 |
oct | 1710641503445 |
9 | 412564536144 |
10 | 130032240421 |
11 | 5016789a906 |
12 | 2124b64b171 |
13 | c3537824c5 |
14 | 641789ca0d |
15 | 35b0ad1381 |
hex | 1e46868725 |
130032240421 has 2 divisors, whose sum is σ = 130032240422. Its totient is φ = 130032240420.
The previous prime is 130032240407. The next prime is 130032240427. The reversal of 130032240421 is 124042230031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119792824321 + 10239416100 = 346111^2 + 101190^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130032240421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130032240392 and 130032240401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130032240427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65016120210 + 65016120211.
It is an arithmetic number, because the mean of its divisors is an integer number (65016120211).
Almost surely, 2130032240421 is an apocalyptic number.
It is an amenable number.
130032240421 is a deficient number, since it is larger than the sum of its proper divisors (1).
130032240421 is an equidigital number, since it uses as much as digits as its factorization.
130032240421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 130032240421 its reverse (124042230031), we get a palindrome (254074470452).
The spelling of 130032240421 in words is "one hundred thirty billion, thirty-two million, two hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •