Base | Representation |
---|---|
bin | 10110111110000011010000… |
… | …000010011110000000000111 |
3 | 111020200112011121211111211221 |
4 | 112332003100002132000013 |
5 | 101220112224001010043 |
6 | 554504243511541211 |
7 | 30164351361312442 |
oct | 2676032002360007 |
9 | 436615147744757 |
10 | 101021121110023 |
11 | 2a2088a92846a4 |
12 | b3b66a108a807 |
13 | 444a33514b80a |
14 | 1ad363c3b6659 |
15 | ba2bd04078ed |
hex | 5be0d009e007 |
101021121110023 has 2 divisors, whose sum is σ = 101021121110024. Its totient is φ = 101021121110022.
The previous prime is 101021121109939. The next prime is 101021121110141. The reversal of 101021121110023 is 320011121120101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101021121110023 - 29 = 101021121109511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101021121109979 and 101021121110006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101021121110423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510560555011 + 50510560555012.
It is an arithmetic number, because the mean of its divisors is an integer number (50510560555012).
Almost surely, 2101021121110023 is an apocalyptic number.
101021121110023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101021121110023 is an equidigital number, since it uses as much as digits as its factorization.
101021121110023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 101021121110023 its reverse (320011121120101), we get a palindrome (421032242230124).
The spelling of 101021121110023 in words is "one hundred one trillion, twenty-one billion, one hundred twenty-one million, one hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •