Base | Representation |
---|---|
bin | 1100111000011010010… |
… | …0110100101101100011 |
3 | 210011012212010022111002 |
4 | 3032012210310231203 |
5 | 12111211042212011 |
6 | 245355255142215 |
7 | 21663022405022 |
oct | 3160644645543 |
9 | 704185108432 |
10 | 221301132131 |
11 | 859427a1032 |
12 | 36a8137496b |
13 | 17b3a43a181 |
14 | a9d51008b9 |
15 | 5b53555c3b |
hex | 3386934b63 |
221301132131 has 2 divisors, whose sum is σ = 221301132132. Its totient is φ = 221301132130.
The previous prime is 221301132103. The next prime is 221301132139. The reversal of 221301132131 is 131231103122.
It is a happy number.
221301132131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221301132131 is a prime.
It is a super-2 number, since 2×2213011321312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (221301132139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110650566065 + 110650566066.
It is an arithmetic number, because the mean of its divisors is an integer number (110650566066).
Almost surely, 2221301132131 is an apocalyptic number.
221301132131 is a deficient number, since it is larger than the sum of its proper divisors (1).
221301132131 is an equidigital number, since it uses as much as digits as its factorization.
221301132131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 221301132131 its reverse (131231103122), we get a palindrome (352532235253).
The spelling of 221301132131 in words is "two hundred twenty-one billion, three hundred one million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •