Base | Representation |
---|---|
bin | 1101001001000101010… |
… | …1101001110100000000 |
3 | 210120202202122021222222 |
4 | 3102101111221310000 |
5 | 12144342312001000 |
6 | 251415333350212 |
7 | 22211646022145 |
oct | 3222125516400 |
9 | 716682567888 |
10 | 225776672000 |
11 | 8782a055410 |
12 | 37910198368 |
13 | 183a172b409 |
14 | acdb6803cc |
15 | 5d16411a85 |
hex | 3491569d00 |
225776672000 has 144 divisors (see below), whose sum is σ = 613569587904. Its totient is φ = 82100480000.
The previous prime is 225776671999. The next prime is 225776672071. The reversal of 225776672000 is 276677522.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31295 + ... + 672705.
It is an arithmetic number, because the mean of its divisors is an integer number (4260899916).
Almost surely, 2225776672000 is an apocalyptic number.
225776672000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 225776672000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (306784793952).
225776672000 is an abundant number, since it is smaller than the sum of its proper divisors (387792915904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225776672000 is an equidigital number, since it uses as much as digits as its factorization.
225776672000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641453 (or 641429 counting only the distinct ones).
The product of its (nonzero) digits is 493920, while the sum is 44.
The spelling of 225776672000 in words is "two hundred twenty-five billion, seven hundred seventy-six million, six hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •