Base | Representation |
---|---|
bin | 1001001111101101110011… |
… | …11101010100101100110100 |
3 | 2122222122101021211102202121 |
4 | 10213312321331110230310 |
5 | 10131101244204310000 |
6 | 111124005133045324 |
7 | 4165611043132612 |
oct | 447667175245464 |
9 | 78878337742677 |
10 | 20331200072500 |
11 | 6529460453619 |
12 | 23443a5926844 |
13 | b462bacc5bb5 |
14 | 50406cd566b2 |
15 | 253cdb6c0b1a |
hex | 127db9f54b34 |
20331200072500 has 30 divisors (see below), whose sum is σ = 44460268324010. Its totient is φ = 8132480028000.
The previous prime is 20331200072483. The next prime is 20331200072551. The reversal of 20331200072500 is 527000213302.
It can be written as a sum of positive squares in 5 ways, for example, as 12228911084196 + 8102288988304 = 3496986^2 + 2846452^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 4066237515 + ... + 4066242514.
Almost surely, 220331200072500 is an apocalyptic number.
20331200072500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20331200072500 is an abundant number, since it is smaller than the sum of its proper divisors (24129068251510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20331200072500 is an equidigital number, since it uses as much as digits as its factorization.
20331200072500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8132480053 (or 8132480036 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 25.
Adding to 20331200072500 its reverse (527000213302), we get a palindrome (20858200285802).
The spelling of 20331200072500 in words is "twenty trillion, three hundred thirty-one billion, two hundred million, seventy-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •