Base | Representation |
---|---|
bin | 11000101011010… |
… | …101101110010000 |
3 | 1001212001002220220 |
4 | 120223111232100 |
5 | 1321441424402 |
6 | 105025433040 |
7 | 13155030633 |
oct | 3053255620 |
9 | 1055032826 |
10 | 414014352 |
11 | 1a2778124 |
12 | b679b780 |
13 | 67a0a40b |
14 | 3cdb1c1a |
15 | 26530dbc |
hex | 18ad5b90 |
414014352 has 160 divisors (see below), whose sum is σ = 1165639680. Its totient is φ = 126297600.
The previous prime is 414014339. The next prime is 414014401. The reversal of 414014352 is 253410414.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4099102 + ... + 4099202.
It is an arithmetic number, because the mean of its divisors is an integer number (7285248).
Almost surely, 2414014352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 414014352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (582819840).
414014352 is an abundant number, since it is smaller than the sum of its proper divisors (751625328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414014352 is a wasteful number, since it uses less digits than its factorization.
414014352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261 (or 255 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 414014352 is about 20347.3426274784. The cubic root of 414014352 is about 745.3126036742.
Adding to 414014352 its reverse (253410414), we get a palindrome (667424766).
It can be divided in two parts, 41401 and 4352, that added together give a triangular number (45753 = T302).
The spelling of 414014352 in words is "four hundred fourteen million, fourteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •