Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …001100001001001110100111 |
3 | 111010110112000102020022221102 |
4 | 112300303221030021032213 |
5 | 101110204322030310043 |
6 | 552530210232310315 |
7 | 30041532103514315 |
oct | 2660635114111647 |
9 | 433415012208842 |
10 | 100111010010023 |
11 | 29997928297811 |
12 | b28a22684239b |
13 | 43b25739762cc |
14 | 1aa15821cb0b5 |
15 | b891b53c46b8 |
hex | 5b0ce93093a7 |
100111010010023 has 2 divisors, whose sum is σ = 100111010010024. Its totient is φ = 100111010010022.
The previous prime is 100111010009999. The next prime is 100111010010157. The reversal of 100111010010023 is 320010010111001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100111010010023 - 238 = 99836132103079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100111010009986 and 100111010010013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100111010090023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055505005011 + 50055505005012.
It is an arithmetic number, because the mean of its divisors is an integer number (50055505005012).
Almost surely, 2100111010010023 is an apocalyptic number.
100111010010023 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111010010023 is an equidigital number, since it uses as much as digits as its factorization.
100111010010023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 100111010010023 its reverse (320010010111001), we get a palindrome (420121020121024).
The spelling of 100111010010023 in words is "one hundred trillion, one hundred eleven billion, ten million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •