Base | Representation |
---|---|
bin | 101010001001110… |
… | …0011100010010001 |
3 | 10122120110121002200 |
4 | 1110103203202101 |
5 | 10344042144213 |
6 | 352203433413 |
7 | 50023210260 |
oct | 12423434221 |
9 | 3576417080 |
10 | 1414412433 |
11 | 666442aa5 |
12 | 335825869 |
13 | 197056845 |
14 | d5bc45d7 |
15 | 84290273 |
hex | 544e3891 |
1414412433 has 24 divisors (see below), whose sum is σ = 2336687808. Its totient is φ = 807617952.
The previous prime is 1414412381. The next prime is 1414412453. The reversal of 1414412433 is 3342144141.
1414412433 is a `hidden beast` number, since 1 + 414 + 4 + 1 + 243 + 3 = 666.
It is not a de Polignac number, because 1414412433 - 28 = 1414412177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1414412397 and 1414412406.
It is not an unprimeable number, because it can be changed into a prime (1414412453) 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 23 ways as a sum of consecutive naturals, for example, 82035 + ... + 97767.
It is an arithmetic number, because the mean of its divisors is an integer number (97361992).
Almost surely, 21414412433 is an apocalyptic number.
It is an amenable number.
1414412433 is a deficient number, since it is larger than the sum of its proper divisors (922275375).
1414412433 is a wasteful number, since it uses less digits than its factorization.
1414412433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17173 (or 17170 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
The square root of 1414412433 is about 37608.6749700119. The cubic root of 1414412433 is about 1122.5146604170.
Adding to 1414412433 its reverse (3342144141), we get a palindrome (4756556574).
The spelling of 1414412433 in words is "one billion, four hundred fourteen million, four hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •