Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …010111101001100100000101 |
3 | 111020122120001221222222000101 |
4 | 112331321311113221210011 |
5 | 101214431022030014112 |
6 | 554455452315444101 |
7 | 30163542664310104 |
oct | 2675716527514405 |
9 | 436576057888011 |
10 | 101011010001157 |
11 | 2a20458a880983 |
12 | b3b473aa56631 |
13 | 44493b342b369 |
14 | 1ad2d5d5b003b |
15 | ba27dc8ed757 |
hex | 5bde755e9905 |
101011010001157 has 2 divisors, whose sum is σ = 101011010001158. Its totient is φ = 101011010001156.
The previous prime is 101011010001067. The next prime is 101011010001233. The reversal of 101011010001157 is 751100010110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87351192746596 + 13659817254561 = 9346186^2 + 3695919^2 .
It is a cyclic number.
It is not a de Polignac number, because 101011010001157 - 227 = 101010875783429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011010001457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505505000578 + 50505505000579.
It is an arithmetic number, because the mean of its divisors is an integer number (50505505000579).
Almost surely, 2101011010001157 is an apocalyptic number.
It is an amenable number.
101011010001157 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011010001157 is an equidigital number, since it uses as much as digits as its factorization.
101011010001157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 19.
Adding to 101011010001157 its reverse (751100010110101), we get a palindrome (852111020111258).
The spelling of 101011010001157 in words is "one hundred one trillion, eleven billion, ten million, one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •