Base | Representation |
---|---|
bin | 11000101100101… |
… | …111000011001000 |
3 | 1001212201200211000 |
4 | 120230233003020 |
5 | 1322040131412 |
6 | 105041335000 |
7 | 13161113430 |
oct | 3054570310 |
9 | 1055650730 |
10 | 414380232 |
11 | 1a29a8002 |
12 | b6937460 |
13 | 67b07b06 |
14 | 3d0692c0 |
15 | 265a44dc |
hex | 18b2f0c8 |
414380232 has 64 divisors (see below), whose sum is σ = 1315497600. Its totient is φ = 118393920.
The previous prime is 414380221. The next prime is 414380237. The reversal of 414380232 is 232083414.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 414380196 and 414380205.
It is not an unprimeable number, because it can be changed into a prime (414380237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135519 + ... + 138542.
It is an arithmetic number, because the mean of its divisors is an integer number (20554650).
Almost surely, 2414380232 is an apocalyptic number.
414380232 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
414380232 is an abundant number, since it is smaller than the sum of its proper divisors (901117368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414380232 is a wasteful number, since it uses less digits than its factorization.
414380232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274083 (or 274073 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 414380232 is about 20356.3314966130. The cubic root of 414380232 is about 745.5320925907.
The spelling of 414380232 in words is "four hundred fourteen million, three hundred eighty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •