Base | Representation |
---|---|
bin | 1100110111010101011… |
… | …0010111100011011101 |
3 | 210010110201022111002221 |
4 | 3031311112113203131 |
5 | 12110113101130023 |
6 | 245310452545341 |
7 | 21652613052163 |
oct | 3156526274335 |
9 | 703421274087 |
10 | 221012130013 |
11 | 85804649504 |
12 | 36a00622251 |
13 | 17ac25c01bc |
14 | a9a8991233 |
15 | 5b37eba85d |
hex | 33755978dd |
221012130013 has 2 divisors, whose sum is σ = 221012130014. Its totient is φ = 221012130012.
The previous prime is 221012129981. The next prime is 221012130043. The reversal of 221012130013 is 310031210122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 180636050169 + 40376079844 = 425013^2 + 200938^2 .
It is a cyclic number.
It is not a de Polignac number, because 221012130013 - 25 = 221012129981 is a prime.
It is a super-2 number, since 2×2210121300132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221012130043) 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, 110506065006 + 110506065007.
It is an arithmetic number, because the mean of its divisors is an integer number (110506065007).
Almost surely, 2221012130013 is an apocalyptic number.
It is an amenable number.
221012130013 is a deficient number, since it is larger than the sum of its proper divisors (1).
221012130013 is an equidigital number, since it uses as much as digits as its factorization.
221012130013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 221012130013 its reverse (310031210122), we get a palindrome (531043340135).
The spelling of 221012130013 in words is "two hundred twenty-one billion, twelve million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •