Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …000101001100011011011111 |
3 | 111010002212120112002022021101 |
4 | 112233111223011030123133 |
5 | 101102031201130323403 |
6 | 552412002115213531 |
7 | 30031330520623255 |
oct | 2657255305143337 |
9 | 433085515068241 |
10 | 100010110011103 |
11 | 2995905a930156 |
12 | b2727675a72a7 |
13 | 43a5bb3870836 |
14 | 1a9a72d8105d5 |
15 | b8675c15d71d |
hex | 5af56b14c6df |
100010110011103 has 2 divisors, whose sum is σ = 100010110011104. Its totient is φ = 100010110011102.
The previous prime is 100010110011013. The next prime is 100010110011131. The reversal of 100010110011103 is 301110011010001.
Together with previous prime (100010110011013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010110011103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100010110011103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010110011143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005055005551 + 50005055005552.
It is an arithmetic number, because the mean of its divisors is an integer number (50005055005552).
Almost surely, 2100010110011103 is an apocalyptic number.
100010110011103 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010110011103 is an equidigital number, since it uses as much as digits as its factorization.
100010110011103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 100010110011103 its reverse (301110011010001), we get a palindrome (401120121021104).
The spelling of 100010110011103 in words is "one hundred trillion, ten billion, one hundred ten million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •