Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …010110010000100111000001 |
3 | 111020122120022221201200021221 |
4 | 112331321323112100213001 |
5 | 101214431223214100342 |
6 | 554455510301315041 |
7 | 30163545322655614 |
oct | 2675717326204701 |
9 | 436576287650257 |
10 | 101011110300097 |
11 | 2a204631456a68 |
12 | b3b4768565a81 |
13 | 44493cb147c4a |
14 | 1ad2d6ca3c17b |
15 | ba27e6611a67 |
hex | 5bde7b5909c1 |
101011110300097 has 2 divisors, whose sum is σ = 101011110300098. Its totient is φ = 101011110300096.
The previous prime is 101011110300049. The next prime is 101011110300103. The reversal of 101011110300097 is 790003011110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79792843443856 + 21218266856241 = 8932684^2 + 4606329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101011110300097 is a prime.
It is a super-3 number, since 3×1010111103000973 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101011110309097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505555150048 + 50505555150049.
It is an arithmetic number, because the mean of its divisors is an integer number (50505555150049).
Almost surely, 2101011110300097 is an apocalyptic number.
It is an amenable number.
101011110300097 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011110300097 is an equidigital number, since it uses as much as digits as its factorization.
101011110300097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 189, while the sum is 25.
Adding to 101011110300097 its reverse (790003011110101), we get a palindrome (891014121410198).
The spelling of 101011110300097 in words is "one hundred one trillion, eleven billion, one hundred ten million, three hundred thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •