Base | Representation |
---|---|
bin | 111100110010110010… |
… | …1000001001110000101 |
3 | 110110222110220211120022 |
4 | 1321211211001032011 |
5 | 4114333111101041 |
6 | 135550400344525 |
7 | 12301142035355 |
oct | 1714545011605 |
9 | 413873824508 |
10 | 130553222021 |
11 | 50404988012 |
12 | 21376015145 |
13 | c4076a2741 |
14 | 6466b56b65 |
15 | 35e16e124b |
hex | 1e65941385 |
130553222021 has 2 divisors, whose sum is σ = 130553222022. Its totient is φ = 130553222020.
The previous prime is 130553222003. The next prime is 130553222053. The reversal of 130553222021 is 120222355031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69492340996 + 61060881025 = 263614^2 + 247105^2 .
It is a cyclic number.
It is not a de Polignac number, because 130553222021 - 210 = 130553220997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130553212021) 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, 65276611010 + 65276611011.
It is an arithmetic number, because the mean of its divisors is an integer number (65276611011).
Almost surely, 2130553222021 is an apocalyptic number.
It is an amenable number.
130553222021 is a deficient number, since it is larger than the sum of its proper divisors (1).
130553222021 is an equidigital number, since it uses as much as digits as its factorization.
130553222021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 130553222021 its reverse (120222355031), we get a palindrome (250775577052).
The spelling of 130553222021 in words is "one hundred thirty billion, five hundred fifty-three million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •