Base | Representation |
---|---|
bin | 110011010100111000100001… |
… | …101001100001101011100000 |
3 | 1002121021002200000211002212010 |
4 | 303110320201221201223200 |
5 | 214041422203123132102 |
6 | 2120033234155432520 |
7 | 65355564012244341 |
oct | 6324704151415340 |
9 | 1077232600732763 |
10 | 225735455677152 |
11 | 65a20961900563 |
12 | 21399063455740 |
13 | 98c59ba531515 |
14 | 3da59237740c8 |
15 | 1b16d6d28ed6c |
hex | cd4e21a61ae0 |
225735455677152 has 48 divisors (see below), whose sum is σ = 592559794512000. Its totient is φ = 75244615592832.
The previous prime is 225735455677099. The next prime is 225735455677153. The reversal of 225735455677152 is 251776554537522.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×2257354556771522 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225735455677153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5274973 + ... + 21892835.
It is an arithmetic number, because the mean of its divisors is an integer number (12344995719000).
Almost surely, 2225735455677152 is an apocalyptic number.
It is an amenable number.
225735455677152 is an abundant number, since it is smaller than the sum of its proper divisors (366824338834848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225735455677152 is a wasteful number, since it uses less digits than its factorization.
225735455677152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16759375 (or 16759367 counting only the distinct ones).
The product of its digits is 617400000, while the sum is 66.
The spelling of 225735455677152 in words is "two hundred twenty-five trillion, seven hundred thirty-five billion, four hundred fifty-five million, six hundred seventy-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •