Base | Representation |
---|---|
bin | 1100000011101000110… |
… | …11010001111111010000 |
3 | 1110121022012102001211002 |
4 | 12001310123101333100 |
5 | 23241411130402130 |
6 | 514151343241132 |
7 | 41634000223250 |
oct | 6016433217720 |
9 | 1417265361732 |
10 | 414270169040 |
11 | 14a76678a632 |
12 | 683562a91a8 |
13 | 300b0c01c50 |
14 | 1609d4c5960 |
15 | ab995e6b45 |
hex | 60746d1fd0 |
414270169040 has 320 divisors, whose sum is σ = 1276910272512. Its totient is φ = 121362278400.
The previous prime is 414270169021. The next prime is 414270169081. The reversal of 414270169040 is 40961072414.
It is a junction number, because it is equal to n+sod(n) for n = 414270168985 and 414270169003.
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 63 ways as a sum of consecutive naturals, for example, 5150735 + ... + 5230545.
Almost surely, 2414270169040 is an apocalyptic number.
414270169040 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 414270169040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (638455136256).
414270169040 is an abundant number, since it is smaller than the sum of its proper divisors (862640103472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414270169040 is a wasteful number, since it uses less digits than its factorization.
414270169040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79898 (or 79892 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 414270169040 in words is "four hundred fourteen billion, two hundred seventy million, one hundred sixty-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •