Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …001011001100111101110011 |
3 | 111010002000022202100011111001 |
4 | 112233031102023030331303 |
5 | 101101404224132034141 |
6 | 552403512215102431 |
7 | 30030561351646114 |
oct | 2657152213147563 |
9 | 433060282304431 |
10 | 100001102221171 |
11 | 299552581a9268 |
12 | b270a72971a17 |
13 | 43a50a95c3918 |
14 | 1a9a11736c20b |
15 | b863d1443a31 |
hex | 5af3522ccf73 |
100001102221171 has 2 divisors, whose sum is σ = 100001102221172. Its totient is φ = 100001102221170.
The previous prime is 100001102221159. The next prime is 100001102221199. The reversal of 100001102221171 is 171122201100001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100001102221171 - 29 = 100001102220659 is a prime.
It is a super-2 number, since 2×1000011022211712 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100001142221171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000551110585 + 50000551110586.
It is an arithmetic number, because the mean of its divisors is an integer number (50000551110586).
Almost surely, 2100001102221171 is an apocalyptic number.
100001102221171 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001102221171 is an equidigital number, since it uses as much as digits as its factorization.
100001102221171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 100001102221171 its reverse (171122201100001), we get a palindrome (271123303321172).
The spelling of 100001102221171 in words is "one hundred trillion, one billion, one hundred two million, two hundred twenty-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •