Base | Representation |
---|---|
bin | 110011011101110110… |
… | …0010000101011000111 |
3 | 101120021112202110011201 |
4 | 1212323230100223013 |
5 | 3302322404440143 |
6 | 122435034043331 |
7 | 10661603025355 |
oct | 1467354205307 |
9 | 346245673151 |
10 | 110523124423 |
11 | 42966471248 |
12 | 19505b79547 |
13 | a5649ba59a |
14 | 54c68787d5 |
15 | 2d1cecc64d |
hex | 19bbb10ac7 |
110523124423 has 4 divisors (see below), whose sum is σ = 110963455848. Its totient is φ = 110082793000.
The previous prime is 110523124381. The next prime is 110523124441. The reversal of 110523124423 is 324421325011.
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 110523124423 - 225 = 110489569991 is a prime.
It is a super-2 number, since 2×1105231244232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110523124391 and 110523124400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110523224423) 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, 220165336 + ... + 220165837.
It is an arithmetic number, because the mean of its divisors is an integer number (27740863962).
Almost surely, 2110523124423 is an apocalyptic number.
110523124423 is a deficient number, since it is larger than the sum of its proper divisors (440331425).
110523124423 is an equidigital number, since it uses as much as digits as its factorization.
110523124423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440331424.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 110523124423 its reverse (324421325011), we get a palindrome (434944449434).
The spelling of 110523124423 in words is "one hundred ten billion, five hundred twenty-three million, one hundred twenty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •