Base | Representation |
---|---|
bin | 10110110010011001001010… |
… | …110100010001100001010001 |
3 | 111010211221101122201101102001 |
4 | 112302121022310101201101 |
5 | 101114001101124231342 |
6 | 553052235331554001 |
7 | 30052441401145612 |
oct | 2662311264214121 |
9 | 433757348641361 |
10 | 100220022102097 |
11 | 29a2a088822a97 |
12 | b2a738a75b901 |
13 | 43bc9275aabc1 |
14 | 1aa69640cdc09 |
15 | b8be458c88b7 |
hex | 5b264ad11851 |
100220022102097 has 2 divisors, whose sum is σ = 100220022102098. Its totient is φ = 100220022102096.
The previous prime is 100220022102089. The next prime is 100220022102119. The reversal of 100220022102097 is 790201220022001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56332590294016 + 43887431808081 = 7505504^2 + 6624759^2 .
It is a cyclic number.
It is not a de Polignac number, because 100220022102097 - 23 = 100220022102089 is a prime.
It is a super-2 number, since 2×1002200221020972 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100220022100097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50110011051048 + 50110011051049.
It is an arithmetic number, because the mean of its divisors is an integer number (50110011051049).
Almost surely, 2100220022102097 is an apocalyptic number.
It is an amenable number.
100220022102097 is a deficient number, since it is larger than the sum of its proper divisors (1).
100220022102097 is an equidigital number, since it uses as much as digits as its factorization.
100220022102097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 100220022102097 its reverse (790201220022001), we get a palindrome (890421242124098).
The spelling of 100220022102097 in words is "one hundred trillion, two hundred twenty billion, twenty-two million, one hundred two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •