Base | Representation |
---|---|
bin | 10110110000101011010001… |
… | …011101101001100011011001 |
3 | 111010102122211000201200022022 |
4 | 112300223101131221203121 |
5 | 101110032420113323342 |
6 | 552522122320304225 |
7 | 30041063265005651 |
oct | 2660532135514331 |
9 | 433378730650268 |
10 | 100102022011097 |
11 | 29994035853127 |
12 | b288538772075 |
13 | 43b1770838652 |
14 | 1aa0d6c61b361 |
15 | b88d3b2b89d2 |
hex | 5b0ad17698d9 |
100102022011097 has 2 divisors, whose sum is σ = 100102022011098. Its totient is φ = 100102022011096.
The previous prime is 100102022011091. The next prime is 100102022011129. The reversal of 100102022011097 is 790110220201001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78034238022601 + 22067783988496 = 8833699^2 + 4697636^2 .
It is a cyclic number.
It is not a de Polignac number, because 100102022011097 - 24 = 100102022011081 is a prime.
It is a super-2 number, since 2×1001020220110972 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100102022011091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051011005548 + 50051011005549.
It is an arithmetic number, because the mean of its divisors is an integer number (50051011005549).
Almost surely, 2100102022011097 is an apocalyptic number.
It is an amenable number.
100102022011097 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102022011097 is an equidigital number, since it uses as much as digits as its factorization.
100102022011097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 26.
Adding to 100102022011097 its reverse (790110220201001), we get a palindrome (890212242212098).
The spelling of 100102022011097 in words is "one hundred trillion, one hundred two billion, twenty-two million, eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •