Base | Representation |
---|---|
bin | 100100010111111… |
… | …1011100001000000 |
3 | 10011001122001022011 |
4 | 1020233323201000 |
5 | 4444423232341 |
6 | 321040022304 |
7 | 42150166201 |
oct | 11057734100 |
9 | 3131561264 |
10 | 1220524096 |
11 | 576a54900 |
12 | 2a0901994 |
13 | 165b2c30c |
14 | b81535a8 |
15 | 72241b81 |
hex | 48bfb840 |
1220524096 has 63 divisors (see below), whose sum is σ = 2668896237. Its totient is φ = 553386240.
The previous prime is 1220524079. The next prime is 1220524099. The reversal of 1220524096 is 6904250221.
The square root of 1220524096 is 34936.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 817960000 + 402564096 = 28600^2 + 20064^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220524099) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3074170 + ... + 3074566.
Almost surely, 21220524096 is an apocalyptic number.
1220524096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1220524096 is the 34936-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1220524096
1220524096 is an abundant number, since it is smaller than the sum of its proper divisors (1448372141).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220524096 is an frugal number, since it uses more digits than its factorization.
1220524096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 828 (or 410 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The cubic root of 1220524096 is about 1068.6827170301.
The spelling of 1220524096 in words is "one billion, two hundred twenty million, five hundred twenty-four thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •