Base | Representation |
---|---|
bin | 100100100001101… |
… | …1101111111000000 |
3 | 10011102021021020220 |
4 | 1021003131333000 |
5 | 10002231133031 |
6 | 321341503040 |
7 | 42241551000 |
oct | 11103357700 |
9 | 3142237226 |
10 | 1225646016 |
11 | 579932aa1 |
12 | 2a2571a80 |
13 | 166c0373a |
14 | b8ac8000 |
15 | 72904596 |
hex | 490ddfc0 |
1225646016 has 224 divisors, whose sum is σ = 3891686400. Its totient is φ = 340042752.
The previous prime is 1225645997. The next prime is 1225646027. The reversal of 1225646016 is 6106465221.
It is a tau number, because it is divible by the number of its divisors (224).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2436421 + ... + 2436923.
It is an arithmetic number, because the mean of its divisors is an integer number (17373600).
Almost surely, 21225646016 is an apocalyptic number.
1225646016 is a gapful number since it is divisible by the number (16) 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 1225646016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1945843200).
1225646016 is an abundant number, since it is smaller than the sum of its proper divisors (2666040384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1225646016 is an equidigital number, since it uses as much as digits as its factorization.
1225646016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576 (or 552 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 1225646016 is about 35009.2275835957. The cubic root of 1225646016 is about 1070.1755370437.
The spelling of 1225646016 in words is "one billion, two hundred twenty-five million, six hundred forty-six thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •