Base | Representation |
---|---|
bin | 101111000101010110… |
… | …0101000000011100111 |
3 | 100122222121120020212012 |
4 | 1132022230220003213 |
5 | 3124033431431043 |
6 | 114241055544435 |
7 | 10206426015356 |
oct | 1361254500347 |
9 | 318877506765 |
10 | 101111202023 |
11 | 39976701687 |
12 | 17719b2b11b |
13 | 96c4ab3130 |
14 | 4c7287799d |
15 | 296ba84a18 |
hex | 178ab280e7 |
101111202023 has 4 divisors (see below), whose sum is σ = 108888986808. Its totient is φ = 93333417240.
The previous prime is 101111202001. The next prime is 101111202061. The reversal of 101111202023 is 320202111101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101111202023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101111201989 and 101111202007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111202223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3888892373 + ... + 3888892398.
It is an arithmetic number, because the mean of its divisors is an integer number (27222246702).
Almost surely, 2101111202023 is an apocalyptic number.
101111202023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
101111202023 is a deficient number, since it is larger than the sum of its proper divisors (7777784785).
101111202023 is an equidigital number, since it uses as much as digits as its factorization.
101111202023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7777784784.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 101111202023 its reverse (320202111101), we get a palindrome (421313313124).
The spelling of 101111202023 in words is "one hundred one billion, one hundred eleven million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •