Base | Representation |
---|---|
bin | 1101010000000011110… |
… | …0011111110101100100 |
3 | 210202121020222210122012 |
4 | 3110000330133311210 |
5 | 12212211134010412 |
6 | 252325222453352 |
7 | 22306233433010 |
oct | 3240074376544 |
9 | 722536883565 |
10 | 227649125732 |
11 | 885aaaa6636 |
12 | 38153294258 |
13 | 1860c638ac2 |
14 | b038217540 |
15 | 5dc59ccc22 |
hex | 3500f1fd64 |
227649125732 has 12 divisors (see below), whose sum is σ = 455298251520. Its totient is φ = 97563911016.
The previous prime is 227649125681. The next prime is 227649125749. The reversal of 227649125732 is 237521946722.
227649125732 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
227649125732 is an admirable number.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
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 3 ways as a sum of consecutive naturals, for example, 4065162932 + ... + 4065162987.
It is an arithmetic number, because the mean of its divisors is an integer number (37941520960).
Almost surely, 2227649125732 is an apocalyptic number.
It is an amenable number.
227649125732 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
227649125732 is a wasteful number, since it uses less digits than its factorization.
227649125732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8130325930 (or 8130325928 counting only the distinct ones).
The product of its digits is 2540160, while the sum is 50.
The spelling of 227649125732 in words is "two hundred twenty-seven billion, six hundred forty-nine million, one hundred twenty-five thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •