Base | Representation |
---|---|
bin | 10110110000101001011111… |
… | …100000010010101000011111 |
3 | 111010102110212210010120202002 |
4 | 112300221133200102220133 |
5 | 101110020011141213043 |
6 | 552521204501352515 |
7 | 30040665021023054 |
oct | 2660513740225037 |
9 | 433373783116662 |
10 | 100100110101023 |
11 | 2999324460285a |
12 | b2880a440873b |
13 | 43b15276c4a06 |
14 | 1aa0c2a73302b |
15 | b88c78506bb8 |
hex | 5b0a5f812a1f |
100100110101023 has 2 divisors, whose sum is σ = 100100110101024. Its totient is φ = 100100110101022.
The previous prime is 100100110100981. The next prime is 100100110101031. The reversal of 100100110101023 is 320101011001001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100100110101023 - 212 = 100100110096927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100100110100995 and 100100110101013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100100110104023) 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, 50050055050511 + 50050055050512.
It is an arithmetic number, because the mean of its divisors is an integer number (50050055050512).
Almost surely, 2100100110101023 is an apocalyptic number.
100100110101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100110101023 is an equidigital number, since it uses as much as digits as its factorization.
100100110101023 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 100100110101023 its reverse (320101011001001), we get a palindrome (420201121102024).
The spelling of 100100110101023 in words is "one hundred trillion, one hundred billion, one hundred ten million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •