Base | Representation |
---|---|
bin | 100100010111001… |
… | …1000111110110000 |
3 | 10011000212112200000 |
4 | 1020232120332300 |
5 | 4444322323441 |
6 | 321023230000 |
7 | 42143565420 |
oct | 11056307660 |
9 | 3130775600 |
10 | 1220120496 |
11 | 5767a9651 |
12 | 2a0748300 |
13 | 165a1a6ba |
14 | b808a480 |
15 | 721b22b6 |
hex | 48b98fb0 |
1220120496 has 240 divisors, whose sum is σ = 4090404864. Its totient is φ = 344881152.
The previous prime is 1220120479. The next prime is 1220120513. The reversal of 1220120496 is 6940210221.
It is an interprime number because it is at equal distance from previous prime (1220120479) and next prime (1220120513).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3456256 + ... + 3456608.
Almost surely, 21220120496 is an apocalyptic number.
1220120496 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 1220120496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2045202432).
1220120496 is an abundant number, since it is smaller than the sum of its proper divisors (2870284368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220120496 is a wasteful number, since it uses less digits than its factorization.
1220120496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510 (or 492 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 1220120496 is about 34930.2232457796. The cubic root of 1220120496 is about 1068.5649075586.
The spelling of 1220120496 in words is "one billion, two hundred twenty million, one hundred twenty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •