Base | Representation |
---|---|
bin | 10110110011101110000000… |
… | …001100110001100000010111 |
3 | 111011011122111212111011212001 |
4 | 112303232000030301200113 |
5 | 101121444124134431411 |
6 | 553202142205140131 |
7 | 30062144603566324 |
oct | 2663560014614027 |
9 | 434148455434761 |
10 | 100311112030231 |
11 | 29a647816aa233 |
12 | b300b7055a647 |
13 | 43c83b316566b |
14 | 1aab125a67b4b |
15 | b8e4c779bdc1 |
hex | 5b3b80331817 |
100311112030231 has 2 divisors, whose sum is σ = 100311112030232. Its totient is φ = 100311112030230.
The previous prime is 100311112030139. The next prime is 100311112030243. The reversal of 100311112030231 is 132030211113001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100311112030231 - 213 = 100311112022039 is a prime.
It is a super-2 number, since 2×1003111120302312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100311112030199 and 100311112030208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100312112030231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50155556015115 + 50155556015116.
It is an arithmetic number, because the mean of its divisors is an integer number (50155556015116).
Almost surely, 2100311112030231 is an apocalyptic number.
100311112030231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100311112030231 is an equidigital number, since it uses as much as digits as its factorization.
100311112030231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 100311112030231 its reverse (132030211113001), we get a palindrome (232341323143232).
The spelling of 100311112030231 in words is "one hundred trillion, three hundred eleven billion, one hundred twelve million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •