Base | Representation |
---|---|
bin | 1101000111001000100… |
… | …1000001001101111100 |
3 | 210112102021202112100200 |
4 | 3101302021001031330 |
5 | 12142304314010200 |
6 | 251251355123500 |
7 | 22162662113046 |
oct | 3216211011574 |
9 | 715367675320 |
10 | 225253266300 |
11 | 87590661a17 |
12 | 377a4a43590 |
13 | 1831a16c9ba |
14 | ac8bd54a96 |
15 | 5cd54c3800 |
hex | 347224137c |
225253266300 has 108 divisors (see below), whose sum is σ = 706213992120. Its totient is φ = 60053063040.
The previous prime is 225253266269. The next prime is 225253266341. The reversal of 225253266300 is 3662352522.
225253266300 is a `hidden beast` number, since 2 + 2 + 5 + 25 + 326 + 6 + 300 = 666.
225253266300 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4006786 + ... + 4062614.
Almost surely, 2225253266300 is an apocalyptic number.
225253266300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
225253266300 is an abundant number, since it is smaller than the sum of its proper divisors (480960725820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225253266300 is a wasteful number, since it uses less digits than its factorization.
225253266300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60332 (or 60322 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
The spelling of 225253266300 in words is "two hundred twenty-five billion, two hundred fifty-three million, two hundred sixty-six thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •