Base | Representation |
---|---|
bin | 11000101100111… |
… | …010011001110100 |
3 | 1001212211001121112 |
4 | 120230322121310 |
5 | 1322043123430 |
6 | 105042334152 |
7 | 13161366140 |
oct | 3054723164 |
9 | 1055731545 |
10 | 414426740 |
11 | 1a2a29a42 |
12 | b695a358 |
13 | 67b23030 |
14 | 3d07c220 |
15 | 265b3195 |
hex | 18b3a674 |
414426740 has 48 divisors (see below), whose sum is σ = 1071138432. Its totient is φ = 131158656.
The previous prime is 414426737. The next prime is 414426743. The reversal of 414426740 is 47624414.
414426740 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (414426737) and next prime (414426743).
It is a junction number, because it is equal to n+sod(n) for n = 414426697 and 414426706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414426743) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 112034 + ... + 115673.
It is an arithmetic number, because the mean of its divisors is an integer number (22315384).
Almost surely, 2414426740 is an apocalyptic number.
It is an amenable number.
414426740 is an abundant number, since it is smaller than the sum of its proper divisors (656711692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414426740 is a wasteful number, since it uses less digits than its factorization.
414426740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227736 (or 227734 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 32.
The square root of 414426740 is about 20357.4738118461. The cubic root of 414426740 is about 745.5599831662.
The spelling of 414426740 in words is "four hundred fourteen million, four hundred twenty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •