Base | Representation |
---|---|
bin | 10110111111101010100111… |
… | …100100100001101101100111 |
3 | 111021002010122201111110122011 |
4 | 112333222213210201231213 |
5 | 101223422030444300314 |
6 | 555031241153215051 |
7 | 30205360665456244 |
oct | 2677524744415547 |
9 | 437063581443564 |
10 | 101132111321959 |
11 | 2a250984372683 |
12 | b4140b7561487 |
13 | 4457942839633 |
14 | 1ad8b6acba5cb |
15 | ba5a293eb4c4 |
hex | 5bfaa7921b67 |
101132111321959 has 2 divisors, whose sum is σ = 101132111321960. Its totient is φ = 101132111321958.
The previous prime is 101132111321911. The next prime is 101132111322001. The reversal of 101132111321959 is 959123111231101.
It is a strong prime.
It is an emirp because it is prime and its reverse (959123111231101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101132111321959 - 213 = 101132111313767 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101132111328959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50566055660979 + 50566055660980.
It is an arithmetic number, because the mean of its divisors is an integer number (50566055660980).
Almost surely, 2101132111321959 is an apocalyptic number.
101132111321959 is a deficient number, since it is larger than the sum of its proper divisors (1).
101132111321959 is an equidigital number, since it uses as much as digits as its factorization.
101132111321959 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14580, while the sum is 40.
The spelling of 101132111321959 in words is "one hundred one trillion, one hundred thirty-two billion, one hundred eleven million, three hundred twenty-one thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •