Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001111100011100000111101 |
3 | 111020222001210121002200001021 |
4 | 112333030232033203200331 |
5 | 101222410310304310414 |
6 | 555004412012144141 |
7 | 30203143343354236 |
oct | 2677145617434075 |
9 | 436861717080037 |
10 | 101100011010109 |
11 | 2a2393015a8231 |
12 | b409a39168051 |
13 | 44548c82a7777 |
14 | 1ad73a394408d |
15 | ba4c9b1e7c24 |
hex | 5bf32e3e383d |
101100011010109 has 2 divisors, whose sum is σ = 101100011010110. Its totient is φ = 101100011010108.
The previous prime is 101100011010041. The next prime is 101100011010133. The reversal of 101100011010109 is 901010110001101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62875035466884 + 38224975543225 = 7929378^2 + 6182635^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100011010109 - 215 = 101100010977341 is a prime.
It is a super-2 number, since 2×1011000110101092 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101100011010092 and 101100011010101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101100011010169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550005505054 + 50550005505055.
It is an arithmetic number, because the mean of its divisors is an integer number (50550005505055).
Almost surely, 2101100011010109 is an apocalyptic number.
It is an amenable number.
101100011010109 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100011010109 is an equidigital number, since it uses as much as digits as its factorization.
101100011010109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 101100011010109 in words is "one hundred one trillion, one hundred billion, eleven million, ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •