Base | Representation |
---|---|
bin | 10101101110001010… |
… | …100110101001110000 |
3 | 2020012102112202011220 |
4 | 111232022212221300 |
5 | 340231204010000 |
6 | 14414155105040 |
7 | 1453653110151 |
oct | 255612465160 |
9 | 66172482156 |
10 | 23323110000 |
11 | 9989318823 |
12 | 462aa42180 |
13 | 2278cbbb08 |
14 | 11b3799928 |
15 | 9178861a0 |
hex | 56e2a6a70 |
23323110000 has 100 divisors (see below), whose sum is σ = 75290205672. Its totient is φ = 6219488000.
The previous prime is 23323109989. The next prime is 23323110011. The reversal of 23323110000 is 1132332.
It is an interprime number because it is at equal distance from previous prime (23323109989) and next prime (23323110011).
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (15).
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 19 ways as a sum of consecutive naturals, for example, 358719 + ... + 418718.
Almost surely, 223323110000 is an apocalyptic number.
23323110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23323110000 is an abundant number, since it is smaller than the sum of its proper divisors (51967095672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23323110000 is an equidigital number, since it uses as much as digits as its factorization.
23323110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777468 (or 777447 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 23323110000 its reverse (1132332), we get a palindrome (23324242332).
The spelling of 23323110000 in words is "twenty-three billion, three hundred twenty-three million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •