Base | Representation |
---|---|
bin | 10101011011100111… |
… | …111011011101011100 |
3 | 2012101202012021001112 |
4 | 111123213323131130 |
5 | 334112034432200 |
6 | 14323243401152 |
7 | 1443155013230 |
oct | 253347733534 |
9 | 65352167045 |
10 | 23012030300 |
11 | 9839766a66 |
12 | 45628231b8 |
13 | 2229711b9c |
14 | 11843405c0 |
15 | 8ea3d9535 |
hex | 55b9fb75c |
23012030300 has 72 divisors (see below), whose sum is σ = 57420241536. Its totient is φ = 7841396160.
The previous prime is 23012030281. The next prime is 23012030383. The reversal of 23012030300 is 303021032.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13259 + ... + 214941.
Almost surely, 223012030300 is an apocalyptic number.
23012030300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23012030300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28710120768).
23012030300 is an abundant number, since it is smaller than the sum of its proper divisors (34408211236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23012030300 is a wasteful number, since it uses less digits than its factorization.
23012030300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201867 (or 201860 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 14.
Adding to 23012030300 its reverse (303021032), we get a palindrome (23315051332).
The spelling of 23012030300 in words is "twenty-three billion, twelve million, thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.295 sec. • engine limits •