Base | Representation |
---|---|
bin | 1100000011011011100… |
… | …11100101000110000000 |
3 | 1110121000110102002022202 |
4 | 12001231303211012000 |
5 | 23241144212120430 |
6 | 514132334452332 |
7 | 41631151151546 |
oct | 6015563450600 |
9 | 1417013362282 |
10 | 414159098240 |
11 | 14a70a017488 |
12 | 683250640a8 |
13 | 30093bb3394 |
14 | 1608c851d96 |
15 | ab8e9a6d45 |
hex | 606dce5180 |
414159098240 has 64 divisors (see below), whose sum is σ = 991003325760. Its totient is φ = 165512343552.
The previous prime is 414159098239. The next prime is 414159098251. The reversal of 414159098240 is 42890951414.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 407129 + ... + 997031.
It is an arithmetic number, because the mean of its divisors is an integer number (15484426965).
Almost surely, 2414159098240 is an apocalyptic number.
414159098240 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 414159098240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (495501662880).
414159098240 is an abundant number, since it is smaller than the sum of its proper divisors (576844227520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414159098240 is a wasteful number, since it uses less digits than its factorization.
414159098240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 591019 (or 591007 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 47.
The spelling of 414159098240 in words is "four hundred fourteen billion, one hundred fifty-nine million, ninety-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •