Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …010101000110001001111001 |
3 | 111020121121021001102220200212 |
4 | 112331300201111012021321 |
5 | 101214300032042023342 |
6 | 554451120135240505 |
7 | 30163040120533505 |
oct | 2675604125061171 |
9 | 436547231386625 |
10 | 101001010111097 |
11 | 2a200319131528 |
12 | b3b2809b19135 |
13 | 444847b77bc55 |
14 | 1ad2691479305 |
15 | ba2404a63182 |
hex | 5bdc21546279 |
101001010111097 has 2 divisors, whose sum is σ = 101001010111098. Its totient is φ = 101001010111096.
The previous prime is 101001010111069. The next prime is 101001010111109. The reversal of 101001010111097 is 790111010100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95567360532736 + 5433649578361 = 9775856^2 + 2331019^2 .
It is a cyclic number.
It is not a de Polignac number, because 101001010111097 - 218 = 101001009848953 is a prime.
It is not a weakly prime, because it can be changed into another prime (101001010111297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500505055548 + 50500505055549.
It is an arithmetic number, because the mean of its divisors is an integer number (50500505055549).
Almost surely, 2101001010111097 is an apocalyptic number.
It is an amenable number.
101001010111097 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001010111097 is an equidigital number, since it uses as much as digits as its factorization.
101001010111097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 23.
Adding to 101001010111097 its reverse (790111010100101), we get a palindrome (891112020211198).
The spelling of 101001010111097 in words is "one hundred one trillion, one billion, ten million, one hundred eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •