Base | Representation |
---|---|
bin | 10101100110110101… |
… | …000010010010001100 |
3 | 2012212211220220021100 |
4 | 111212311002102030 |
5 | 340003200444000 |
6 | 14354040503100 |
7 | 1450626610104 |
oct | 254665022214 |
9 | 65784826240 |
10 | 23200015500 |
11 | 9925893032 |
12 | 45b577aa90 |
13 | 225965052c |
14 | 11a12b6204 |
15 | 90bb6da00 |
hex | 566d4248c |
23200015500 has 144 divisors (see below), whose sum is σ = 73324611360. Its totient is φ = 6175152000.
The previous prime is 23200015441. The next prime is 23200015513. The reversal of 23200015500 is 551000232.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2564986 + ... + 2574014.
It is an arithmetic number, because the mean of its divisors is an integer number (509198690).
Almost surely, 223200015500 is an apocalyptic number.
23200015500 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 23200015500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36662305680).
23200015500 is an abundant number, since it is smaller than the sum of its proper divisors (50124595860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23200015500 is a wasteful number, since it uses less digits than its factorization.
23200015500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9625 (or 9610 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
Adding to 23200015500 its reverse (551000232), we get a palindrome (23751015732).
The spelling of 23200015500 in words is "twenty-three billion, two hundred million, fifteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •