Base | Representation |
---|---|
bin | 111000010001101011… |
… | …110100000000000000 |
3 | 12202222012122001002220 |
4 | 320101223310000000 |
5 | 1442223104140000 |
6 | 43432012011040 |
7 | 4236263364630 |
oct | 702153640000 |
9 | 182865561086 |
10 | 60426240000 |
11 | 23699045525 |
12 | b864760a80 |
13 | 590cb581c9 |
14 | 2cd33286c0 |
15 | 1889d9b1a0 |
hex | e11af4000 |
60426240000 has 600 divisors, whose sum is σ = 230933427648. Its totient is φ = 13762560000.
The previous prime is 60426239987. The next prime is 60426240001. The reversal of 60426240000 is 4262406.
It is a tau number, because it is divible by the number of its divisors (600).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60426240001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 215039860 + ... + 215040140.
Almost surely, 260426240000 is an apocalyptic number.
60426240000 is a gapful number since it is divisible by the number (60) 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 60426240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115466713824).
60426240000 is an abundant number, since it is smaller than the sum of its proper divisors (170507187648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60426240000 is an frugal number, since it uses more digits than its factorization.
60426240000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339 (or 298 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
The spelling of 60426240000 in words is "sixty billion, four hundred twenty-six million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •