Base | Representation |
---|---|
bin | 1100111000011010100… |
… | …0101000111001110011 |
3 | 210011012221000010111211 |
4 | 3032012220220321303 |
5 | 12111211321213324 |
6 | 245355332420551 |
7 | 21663034042051 |
oct | 3160650507163 |
9 | 704187003454 |
10 | 221302132339 |
11 | 85943314552 |
12 | 36a81777757 |
13 | 17b3a6ca502 |
14 | a9d52c11d1 |
15 | 5b536a2294 |
hex | 3386a28e73 |
221302132339 has 2 divisors, whose sum is σ = 221302132340. Its totient is φ = 221302132338.
The previous prime is 221302132283. The next prime is 221302132351. The reversal of 221302132339 is 933231203122.
221302132339 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-221302132339 is a prime.
It is a super-2 number, since 2×2213021323392 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 221302132339.
It is not a weakly prime, because it can be changed into another prime (221302132379) 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, 110651066169 + 110651066170.
It is an arithmetic number, because the mean of its divisors is an integer number (110651066170).
Almost surely, 2221302132339 is an apocalyptic number.
221302132339 is a deficient number, since it is larger than the sum of its proper divisors (1).
221302132339 is an equidigital number, since it uses as much as digits as its factorization.
221302132339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 221302132339 in words is "two hundred twenty-one billion, three hundred two million, one hundred thirty-two thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •