Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111111111010010011000111 |
3 | 112102110220020012212021101111 |
4 | 121000231132333322103013 |
5 | 103404220000303330043 |
6 | 1025541145234105451 |
7 | 32112144401131612 |
oct | 3100553677722307 |
9 | 472426205767344 |
10 | 110000001230023 |
11 | 3205a814000343 |
12 | 104068a1a1b287 |
13 | 494bc56612298 |
14 | 1d24058181179 |
15 | cab5448a709d |
hex | 640b5effa4c7 |
110000001230023 has 4 divisors (see below), whose sum is σ = 110000088671608. Its totient is φ = 109999913788440.
The previous prime is 110000001230003. The next prime is 110000001230051. The reversal of 110000001230023 is 320032100000011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110000001230023 - 229 = 109999464359111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110000001229985 and 110000001230012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000001230003) 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, 41805861 + ... + 44359102.
It is an arithmetic number, because the mean of its divisors is an integer number (27500022167902).
Almost surely, 2110000001230023 is an apocalyptic number.
110000001230023 is a deficient number, since it is larger than the sum of its proper divisors (87441585).
110000001230023 is an equidigital number, since it uses as much as digits as its factorization.
110000001230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87441584.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 110000001230023 its reverse (320032100000011), we get a palindrome (430032101230034).
The spelling of 110000001230023 in words is "one hundred ten trillion, one million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •