Base | Representation |
---|---|
bin | 100100100001011… |
… | …0011011011000000 |
3 | 10011101221102010000 |
4 | 1021002303123000 |
5 | 10002210043210 |
6 | 321334040000 |
7 | 42240223506 |
oct | 11102633300 |
9 | 3141842100 |
10 | 1225471680 |
11 | 579824014 |
12 | 2a24a9000 |
13 | 166b72294 |
14 | b8a80676 |
15 | 728bcac0 |
hex | 490b36c0 |
1225471680 has 140 divisors (see below), whose sum is σ = 4359310560. Its totient is φ = 326785536.
The previous prime is 1225471669. The next prime is 1225471699. The reversal of 1225471680 is 861745221.
1225471680 is a `hidden beast` number, since 1 + 22 + 547 + 16 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2281 + ... + 49559.
Almost surely, 21225471680 is an apocalyptic number.
1225471680 is a gapful number since it is divisible by the number (10) 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 1225471680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2179655280).
1225471680 is an abundant number, since it is smaller than the sum of its proper divisors (3133838880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1225471680 is an equidigital number, since it uses as much as digits as its factorization.
1225471680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47308 (or 47289 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 1225471680 is about 35006.7376372035. The cubic root of 1225471680 is about 1070.1247940161.
The spelling of 1225471680 in words is "one billion, two hundred twenty-five million, four hundred seventy-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •