Search a number
-
+
23011020110 = 2513593000133
BaseRepresentation
bin10101011011100100…
…000100110101001110
32012101200021221100002
4111123210010311032
5334111310120420
614323210004302
71443143305121
oct253344046516
965350257302
1023011020110
119839136aa1
124562416692
13222944a140
14118415a3b8
158ea28a075
hex55b904d4e

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".

Divisors: 1 2 5 10 13 26 59 65 118 130 295 590 767 1534 3835 7670 3000133 6000266 15000665 30001330 39001729 78003458 177007847 195008645 354015694 390017290 885039235 1770078470 2301102011 4602204022 11505510055 23011020110