Base | Representation |
---|---|
bin | 101011110001101011000 |
3 | 2200212201000 |
4 | 11132031120 |
5 | 331400311 |
6 | 50425000 |
7 | 15123042 |
oct | 5361530 |
9 | 2625630 |
10 | 1434456 |
11 | 89a801 |
12 | 592160 |
13 | 3b2bba |
14 | 294a92 |
15 | 1d5056 |
hex | 15e358 |
1434456 has 64 divisors (see below), whose sum is σ = 4140000. Its totient is φ = 459648.
The previous prime is 1434451. The next prime is 1434457. The reversal of 1434456 is 6544341.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1434451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6150 + ... + 6378.
21434456 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 1434456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2070000).
1434456 is an abundant number, since it is smaller than the sum of its proper divisors (2705544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1434456 is a wasteful number, since it uses less digits than its factorization.
1434456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273 (or 263 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 1434456 is about 1197.6877723347. The cubic root of 1434456 is about 112.7792175384.
Adding to 1434456 its reverse (6544341), we get a palindrome (7978797).
It can be divided in two parts, 14344 and 56, that added together give a square (14400 = 1202).
The spelling of 1434456 in words is "one million, four hundred thirty-four thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •