Base | Representation |
---|---|
bin | 10110110110100011100110… |
… | …011101000101100101001001 |
3 | 111011212021210222211210120111 |
4 | 112312203212131011211021 |
5 | 101133142443341023423 |
6 | 553431510533554321 |
7 | 30112216610460565 |
oct | 2666434635054511 |
9 | 434767728753514 |
10 | 100506101111113 |
11 | 2a02a441985765 |
12 | b332909aa59a1 |
13 | 44108b92a1c29 |
14 | 1ab67424446a5 |
15 | b945dad5e60d |
hex | 5b68e6745949 |
100506101111113 has 2 divisors, whose sum is σ = 100506101111114. Its totient is φ = 100506101111112.
The previous prime is 100506101111111. The next prime is 100506101111177. The reversal of 100506101111113 is 311111101605001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91919542651024 + 8586558460089 = 9587468^2 + 2930283^2 .
It is a cyclic number.
It is not a de Polignac number, because 100506101111113 - 21 = 100506101111111 is a prime.
Together with 100506101111111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100506101111111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50253050555556 + 50253050555557.
It is an arithmetic number, because the mean of its divisors is an integer number (50253050555557).
Almost surely, 2100506101111113 is an apocalyptic number.
It is an amenable number.
100506101111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100506101111113 is an equidigital number, since it uses as much as digits as its factorization.
100506101111113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90, while the sum is 22.
Adding to 100506101111113 its reverse (311111101605001), we get a palindrome (411617202716114).
The spelling of 100506101111113 in words is "one hundred trillion, five hundred six billion, one hundred one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •