Base | Representation |
---|---|
bin | 10110111111010111111111… |
… | …011101010110101100000011 |
3 | 111021000020000212100212011222 |
4 | 112333113333131112230003 |
5 | 101223110100404002243 |
6 | 555014132413025255 |
7 | 30204052240522523 |
oct | 2677277735265403 |
9 | 437006025325158 |
10 | 101112111000323 |
11 | 2a243450743a45 |
12 | b41025548522b |
13 | 4455aa607b4a7 |
14 | 1ad7bd094d683 |
15 | ba525861a168 |
hex | 5bf5ff756b03 |
101112111000323 has 2 divisors, whose sum is σ = 101112111000324. Its totient is φ = 101112111000322.
The previous prime is 101112111000239. The next prime is 101112111000419. The reversal of 101112111000323 is 323000111211101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101112111000323 - 28 = 101112111000067 is a prime.
It is a super-2 number, since 2×1011121110003232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101112111200323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556055500161 + 50556055500162.
It is an arithmetic number, because the mean of its divisors is an integer number (50556055500162).
Almost surely, 2101112111000323 is an apocalyptic number.
101112111000323 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112111000323 is an equidigital number, since it uses as much as digits as its factorization.
101112111000323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 101112111000323 its reverse (323000111211101), we get a palindrome (424112222211424).
The spelling of 101112111000323 in words is "one hundred one trillion, one hundred twelve billion, one hundred eleven million, three hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •