Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1010011011101010111 |
3 | 101111221210110010102202 |
4 | 1212131013103131113 |
5 | 3300300042320043 |
6 | 122312110355115 |
7 | 10643103406616 |
oct | 1463507233527 |
9 | 344853403382 |
10 | 110010120023 |
11 | 42722932471 |
12 | 193a21bba9b |
13 | a4b263129b |
14 | 547869987d |
15 | 2cdce461b8 |
hex | 199d1d3757 |
110010120023 has 4 divisors (see below), whose sum is σ = 115800126360. Its totient is φ = 104220113688.
The previous prime is 110010119953. The next prime is 110010120047. The reversal of 110010120023 is 320021010011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320021010011 = 23 ⋅13913956957.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110010120023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010119986 and 110010120013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110010120083) 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, 2895003140 + ... + 2895003177.
It is an arithmetic number, because the mean of its divisors is an integer number (28950031590).
Almost surely, 2110010120023 is an apocalyptic number.
110010120023 is a deficient number, since it is larger than the sum of its proper divisors (5790006337).
110010120023 is an equidigital number, since it uses as much as digits as its factorization.
110010120023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5790006336.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 110010120023 its reverse (320021010011), we get a palindrome (430031130034).
The spelling of 110010120023 in words is "one hundred ten billion, ten million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •