Base | Representation |
---|---|
bin | 11000101100011… |
… | …011001101111000 |
3 | 1001212120120101102 |
4 | 120230123031320 |
5 | 1322030032000 |
6 | 105035510532 |
7 | 13160324543 |
oct | 3054331570 |
9 | 1055516342 |
10 | 414299000 |
11 | 1a2951a75 |
12 | b68b8448 |
13 | 67aa9b4b |
14 | 3d04785a |
15 | 2658a3d5 |
hex | 18b1b378 |
414299000 has 64 divisors (see below), whose sum is σ = 1011666240. Its totient is φ = 158505600.
The previous prime is 414298999. The next prime is 414299021. The reversal of 414299000 is 992414.
It is a super-3 number, since 3×4142990003 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13994 + ... + 32006.
It is an arithmetic number, because the mean of its divisors is an integer number (15807285).
Almost surely, 2414299000 is an apocalyptic number.
414299000 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 414299000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (505833120).
414299000 is an abundant number, since it is smaller than the sum of its proper divisors (597367240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414299000 is a wasteful number, since it uses less digits than its factorization.
414299000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18057 (or 18043 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 414299000 is about 20354.3361473667. The cubic root of 414299000 is about 745.4833732295.
The spelling of 414299000 in words is "four hundred fourteen million, two hundred ninety-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •