Base | Representation |
---|---|
bin | 100001100101101100… |
… | …1111110010101010100 |
3 | 20220012000012100001022 |
4 | 1003023121332111110 |
5 | 2140211301414000 |
6 | 53045332220312 |
7 | 5132333253323 |
oct | 1031331762524 |
9 | 226160170038 |
10 | 72132060500 |
11 | 28655738745 |
12 | 11b90a6a698 |
13 | 6a5707c306 |
14 | 36c3c4a0ba |
15 | 1d228ac585 |
hex | 10cb67e554 |
72132060500 has 36 divisors (see below), whose sum is σ = 157549537236. Its totient is φ = 28850422000.
The previous prime is 72132060479. The next prime is 72132060563. The reversal of 72132060500 is 506023127.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 2308225936 + 69823834564 = 48044^2 + 264242^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 72132060500.
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 11 ways as a sum of consecutive naturals, for example, 5999495 + ... + 6011505.
Almost surely, 272132060500 is an apocalyptic number.
It is an amenable number.
72132060500 is an abundant number, since it is smaller than the sum of its proper divisors (85417476736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72132060500 is an frugal number, since it uses more digits than its factorization.
72132060500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24041 (or 12018 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 26.
Adding to 72132060500 its reverse (506023127), we get a palindrome (72638083627).
The spelling of 72132060500 in words is "seventy-two billion, one hundred thirty-two million, sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •