Base | Representation |
---|---|
bin | 10110110001001000001110… |
… | …101000110010011010100111 |
3 | 111010112122001211010021001112 |
4 | 112301020032220302122213 |
5 | 101111040103424042411 |
6 | 552544303410415235 |
7 | 30043243614005453 |
oct | 2661101650623247 |
9 | 433478054107045 |
10 | 100133113112231 |
11 | 299a623a983631 |
12 | b292574b9151b |
13 | 43b4686c86b04 |
14 | 1aa267b929663 |
15 | b89a5aabbb8b |
hex | 5b120ea326a7 |
100133113112231 has 2 divisors, whose sum is σ = 100133113112232. Its totient is φ = 100133113112230.
The previous prime is 100133113112191. The next prime is 100133113112237. The reversal of 100133113112231 is 132211311331001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100133113112231 - 234 = 100115933243047 is a prime.
It is a super-2 number, since 2×1001331131122312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100133113112197 and 100133113112206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100133113112237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50066556556115 + 50066556556116.
It is an arithmetic number, because the mean of its divisors is an integer number (50066556556116).
Almost surely, 2100133113112231 is an apocalyptic number.
100133113112231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100133113112231 is an equidigital number, since it uses as much as digits as its factorization.
100133113112231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 100133113112231 its reverse (132211311331001), we get a palindrome (232344424443232).
The spelling of 100133113112231 in words is "one hundred trillion, one hundred thirty-three billion, one hundred thirteen million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •