Base | Representation |
---|---|
bin | 1100010101111101000… |
… | …00100111001101110000 |
3 | 1111112200110122102002110 |
4 | 12022332200213031300 |
5 | 23422030332442110 |
6 | 522455155245320 |
7 | 42432445102410 |
oct | 6127640471560 |
9 | 1445613572073 |
10 | 424103015280 |
11 | 15395210653a |
12 | 6a23b2a9840 |
13 | 30cba095769 |
14 | 16753376640 |
15 | b072987a20 |
hex | 62be827370 |
424103015280 has 160 divisors (see below), whose sum is σ = 1502917807104. Its totient is φ = 96913225728.
The previous prime is 424103015261. The next prime is 424103015293. The reversal of 424103015280 is 82510301424.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7054629 + ... + 7114491.
Almost surely, 2424103015280 is an apocalyptic number.
424103015280 is a gapful number since it is divisible by the number (40) 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 424103015280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (751458903552).
424103015280 is an abundant number, since it is smaller than the sum of its proper divisors (1078814791824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
424103015280 is a wasteful number, since it uses less digits than its factorization.
424103015280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64103 (or 64097 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
The spelling of 424103015280 in words is "four hundred twenty-four billion, one hundred three million, fifteen thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •