Base | Representation |
---|---|
bin | 101111000101111100… |
… | …1000010101001000001 |
3 | 100200001000020222100222 |
4 | 1132023321002221001 |
5 | 3124104043440412 |
6 | 114243053152425 |
7 | 10210061206253 |
oct | 1361371025101 |
9 | 320030228328 |
10 | 101131233857 |
11 | 39986a43915 |
12 | 1772478b715 |
13 | 96c8ca7ba4 |
14 | 4c753adcd3 |
15 | 296d6e0072 |
hex | 178be42a41 |
101131233857 has 2 divisors, whose sum is σ = 101131233858. Its totient is φ = 101131233856.
The previous prime is 101131233829. The next prime is 101131233913. The reversal of 101131233857 is 758332131101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87427253761 + 13703980096 = 295681^2 + 117064^2 .
It is a cyclic number.
It is not a de Polignac number, because 101131233857 - 28 = 101131233601 is a prime.
It is a super-2 number, since 2×1011312338572 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101131233457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50565616928 + 50565616929.
It is an arithmetic number, because the mean of its divisors is an integer number (50565616929).
Almost surely, 2101131233857 is an apocalyptic number.
It is an amenable number.
101131233857 is a deficient number, since it is larger than the sum of its proper divisors (1).
101131233857 is an equidigital number, since it uses as much as digits as its factorization.
101131233857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 35.
Adding to 101131233857 its reverse (758332131101), we get a palindrome (859463364958).
The spelling of 101131233857 in words is "one hundred one billion, one hundred thirty-one million, two hundred thirty-three thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •