Base | Representation |
---|---|
bin | 101111000101010010… |
… | …0101010000011100011 |
3 | 100122222110122010100011 |
4 | 1132022210222003203 |
5 | 3124032413104214 |
6 | 114240543105351 |
7 | 10206402165163 |
oct | 1361244520343 |
9 | 318873563304 |
10 | 101109113059 |
11 | 39975505169 |
12 | 177192a2257 |
13 | 96c4531366 |
14 | 4c724925a3 |
15 | 296b7c0ac4 |
hex | 178a92a0e3 |
101109113059 has 2 divisors, whose sum is σ = 101109113060. Its totient is φ = 101109113058.
The previous prime is 101109113009. The next prime is 101109113099. The reversal of 101109113059 is 950311901101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101109113059 - 211 = 101109111011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101109113059.
It is not a weakly prime, because it can be changed into another prime (101109113009) 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, 50554556529 + 50554556530.
It is an arithmetic number, because the mean of its divisors is an integer number (50554556530).
Almost surely, 2101109113059 is an apocalyptic number.
101109113059 is a deficient number, since it is larger than the sum of its proper divisors (1).
101109113059 is an equidigital number, since it uses as much as digits as its factorization.
101109113059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1215, while the sum is 31.
The spelling of 101109113059 in words is "one hundred one billion, one hundred nine million, one hundred thirteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •