Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …000101001100011011111011 |
3 | 111010002212120112002022022102 |
4 | 112233111223011030123323 |
5 | 101102031201130324011 |
6 | 552412002115214015 |
7 | 30031330520623325 |
oct | 2657255305143373 |
9 | 433085515068272 |
10 | 100010110011131 |
11 | 2995905a930181 |
12 | b2727675a730b |
13 | 43a5bb3870858 |
14 | 1a9a72d810615 |
15 | b8675c15d73b |
hex | 5af56b14c6fb |
100010110011131 has 2 divisors, whose sum is σ = 100010110011132. Its totient is φ = 100010110011130.
The previous prime is 100010110011103. The next prime is 100010110011143. The reversal of 100010110011131 is 131110011010001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100010110011131 - 226 = 100010042902267 is a prime.
It is a super-2 number, since 2×1000101100111312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100010110011151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005055005565 + 50005055005566.
It is an arithmetic number, because the mean of its divisors is an integer number (50005055005566).
Almost surely, 2100010110011131 is an apocalyptic number.
100010110011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010110011131 is an equidigital number, since it uses as much as digits as its factorization.
100010110011131 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 11.
Adding to 100010110011131 its reverse (131110011010001), we get a palindrome (231120121021132).
The spelling of 100010110011131 in words is "one hundred trillion, ten billion, one hundred ten million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •