Base | Representation |
---|---|
bin | 1010100011010101001100… |
… | …10001110010000110010100 |
3 | 10001011022002210201121211220 |
4 | 11101222212101302012110 |
5 | 11020134201432400000 |
6 | 121203510320530340 |
7 | 4613306532161526 |
oct | 521524621620624 |
9 | 101138083647756 |
10 | 23204203012500 |
11 | 7436935739464 |
12 | 27291687809b0 |
13 | cc41bab24a43 |
14 | 5a3137513a16 |
15 | 2a38dba261a0 |
hex | 151aa6472194 |
23204203012500 has 72 divisors (see below), whose sum is σ = 67674594111264. Its totient is φ = 6187787460000.
The previous prime is 23204203012453. The next prime is 23204203012519. The reversal of 23204203012500 is 521030240232.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 309351874 + ... + 309426873.
It is an arithmetic number, because the mean of its divisors is an integer number (939924918212).
Almost surely, 223204203012500 is an apocalyptic number.
23204203012500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23204203012500 is an abundant number, since it is smaller than the sum of its proper divisors (44470391098764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23204203012500 is an equidigital number, since it uses as much as digits as its factorization.
23204203012500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618778779 (or 618778757 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 23204203012500 its reverse (521030240232), we get a palindrome (23725233252732).
The spelling of 23204203012500 in words is "twenty-three trillion, two hundred four billion, two hundred three million, twelve thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •