Base | Representation |
---|---|
bin | 10010001011111111000… |
… | …110100100011100110000 |
3 | 11102111000010122002020110 |
4 | 102023333012210130300 |
5 | 130434113012144310 |
6 | 2354054245141320 |
7 | 156203500232340 |
oct | 22137706443460 |
9 | 4374003562213 |
10 | 1249820428080 |
11 | 44205605a0a4 |
12 | 1822823ba840 |
13 | 90b1c0a3653 |
14 | 446c5072d20 |
15 | 2279d90dd20 |
hex | 122ff1a4730 |
1249820428080 has 320 divisors, whose sum is σ = 4512769164288. Its totient is φ = 280235704320.
The previous prime is 1249820428079. The next prime is 1249820428139. The reversal of 1249820428080 is 808240289421.
It is a super-2 number, since 2×12498204280802 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27103924 + ... + 27149996.
Almost surely, 21249820428080 is an apocalyptic number.
1249820428080 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 1249820428080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2256384582144).
1249820428080 is an abundant number, since it is smaller than the sum of its proper divisors (3262948736208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1249820428080 is a wasteful number, since it uses less digits than its factorization.
1249820428080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46404 (or 46398 counting only the distinct ones).
The product of its (nonzero) digits is 589824, while the sum is 48.
The spelling of 1249820428080 in words is "one trillion, two hundred forty-nine billion, eight hundred twenty million, four hundred twenty-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •