Base | Representation |
---|---|
bin | 10101011011100100… |
… | …000100110101001110 |
3 | 2012101200021221100002 |
4 | 111123210010311032 |
5 | 334111310120420 |
6 | 14323210004302 |
7 | 1443143305121 |
oct | 253344046516 |
9 | 65350257302 |
10 | 23011020110 |
11 | 9839136aa1 |
12 | 4562416692 |
13 | 222944a140 |
14 | 118415a3b8 |
15 | 8ea28a075 |
hex | 55b904d4e |
23011020110 has 32 divisors (see below), whose sum is σ = 45362026080. Its totient is φ = 8352367488.
The previous prime is 23011020107. The next prime is 23011020127. The reversal of 23011020110 is 1102011032.
It is a junction number, because it is equal to n+sod(n) for n = 23011020091 and 23011020100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1492397 + ... + 1507736.
It is an arithmetic number, because the mean of its divisors is an integer number (1417563315).
Almost surely, 223011020110 is an apocalyptic number.
23011020110 is a deficient number, since it is larger than the sum of its proper divisors (22351005970).
23011020110 is a wasteful number, since it uses less digits than its factorization.
23011020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3000212.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 23011020110 its reverse (1102011032), we get a palindrome (24113031142).
The spelling of 23011020110 in words is "twenty-three billion, eleven million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •