Base | Representation |
---|---|
bin | 101010011100011… |
… | …1100010110111001 |
3 | 10200020220112112200 |
4 | 1110320330112321 |
5 | 10404044312213 |
6 | 353153500413 |
7 | 50202420516 |
oct | 12470742671 |
9 | 3606815480 |
10 | 1424213433 |
11 | 670a276a5 |
12 | 338b71709 |
13 | 1990a8956 |
14 | d721630d |
15 | 85079273 |
hex | 54e3c5b9 |
1424213433 has 24 divisors (see below), whose sum is σ = 2124036096. Its totient is φ = 918993600.
The previous prime is 1424213389. The next prime is 1424213443. The reversal of 1424213433 is 3343124241.
1424213433 is a `hidden beast` number, since 14 + 2 + 4 + 213 + 433 = 666.
It is not a de Polignac number, because 1424213433 - 29 = 1424212921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1424213397 and 1424213406.
It is not an unprimeable number, because it can be changed into a prime (1424213443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31668 + ... + 62058.
It is an arithmetic number, because the mean of its divisors is an integer number (88501504).
Almost surely, 21424213433 is an apocalyptic number.
It is an amenable number.
1424213433 is a deficient number, since it is larger than the sum of its proper divisors (699822663).
1424213433 is a wasteful number, since it uses less digits than its factorization.
1424213433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30565 (or 30562 counting only the distinct ones).
The product of its digits is 6912, while the sum is 27.
The square root of 1424213433 is about 37738.7524038620. The cubic root of 1424213433 is about 1125.1014711437.
Adding to 1424213433 its reverse (3343124241), we get a palindrome (4767337674).
The spelling of 1424213433 in words is "one billion, four hundred twenty-four million, two hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •