Base | Representation |
---|---|
bin | 10101101101100100… |
… | …011011100100000110 |
3 | 2020011201201100022100 |
4 | 111231210123210012 |
5 | 340221123244420 |
6 | 14413200412530 |
7 | 1453502051433 |
oct | 255544334406 |
9 | 66151640270 |
10 | 23313103110 |
11 | 9983703470 |
12 | 4627617146 |
13 | 2276bc708b |
14 | 11b2312b8a |
15 | 916a5b190 |
hex | 56d91b906 |
23313103110 has 192 divisors, whose sum is σ = 67574497536. Its totient is φ = 5528390400.
The previous prime is 23313103097. The next prime is 23313103147. The reversal of 23313103110 is 1130131332.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 95 ways as a sum of consecutive naturals, for example, 33737865 + ... + 33738555.
It is an arithmetic number, because the mean of its divisors is an integer number (351950508).
Almost surely, 223313103110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23313103110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33787248768).
23313103110 is an abundant number, since it is smaller than the sum of its proper divisors (44261394426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23313103110 is a wasteful number, since it uses less digits than its factorization.
23313103110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411 (or 1408 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 23313103110 its reverse (1130131332), we get a palindrome (24443234442).
The spelling of 23313103110 in words is "twenty-three billion, three hundred thirteen million, one hundred three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •