Base | Representation |
---|---|
bin | 110010010010111010101000… |
… | …010110010100000000111111 |
3 | 1002000012201121202010111100001 |
4 | 302102322220112110000333 |
5 | 212443134131401200111 |
6 | 2102242522431015131 |
7 | 64410222320515015 |
oct | 6222725026240077 |
9 | 1060181552114301 |
10 | 221202230100031 |
11 | 64533380185654 |
12 | 2098658336a4a7 |
13 | 9657385b9a61b |
14 | 3c8a3606408b5 |
15 | 1a88e9e7c61c1 |
hex | c92ea859403f |
221202230100031 has 2 divisors, whose sum is σ = 221202230100032. Its totient is φ = 221202230100030.
The previous prime is 221202230099933. The next prime is 221202230100077. The reversal of 221202230100031 is 130001032202122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 221202230100031 - 235 = 221167870361663 is a prime.
It is a super-2 number, since 2×2212022301000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 221202230099981 and 221202230100008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221202230100931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110601115050015 + 110601115050016.
It is an arithmetic number, because the mean of its divisors is an integer number (110601115050016).
Almost surely, 2221202230100031 is an apocalyptic number.
221202230100031 is a deficient number, since it is larger than the sum of its proper divisors (1).
221202230100031 is an equidigital number, since it uses as much as digits as its factorization.
221202230100031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 221202230100031 its reverse (130001032202122), we get a palindrome (351203262302153).
The spelling of 221202230100031 in words is "two hundred twenty-one trillion, two hundred two billion, two hundred thirty million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •