Base | Representation |
---|---|
bin | 101010001001110… |
… | …1000100101101101 |
3 | 10122120111122111100 |
4 | 1110103220211231 |
5 | 10344043330013 |
6 | 352204113313 |
7 | 50023324521 |
oct | 12423504555 |
9 | 3576448440 |
10 | 1414433133 |
11 | 666457603 |
12 | 335835839 |
13 | 1970630a9 |
14 | d5bcbd81 |
15 | 84296473 |
hex | 544e896d |
1414433133 has 24 divisors (see below), whose sum is σ = 2169531000. Its totient is φ = 884911104.
The previous prime is 1414433113. The next prime is 1414433149. The reversal of 1414433133 is 3313344141.
It can be written as a sum of positive squares in 4 ways, for example, as 348867684 + 1065565449 = 18678^2 + 32643^2 .
It is not a de Polignac number, because 1414433133 - 214 = 1414416749 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1414433097 and 1414433106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414433113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40153 + ... + 66641.
It is an arithmetic number, because the mean of its divisors is an integer number (90397125).
Almost surely, 21414433133 is an apocalyptic number.
It is an amenable number.
1414433133 is a deficient number, since it is larger than the sum of its proper divisors (755097867).
1414433133 is a wasteful number, since it uses less digits than its factorization.
1414433133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26861 (or 26858 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
The square root of 1414433133 is about 37608.9501714685. The cubic root of 1414433133 is about 1122.5201364106.
Adding to 1414433133 its reverse (3313344141), we get a palindrome (4727777274).
The spelling of 1414433133 in words is "one billion, four hundred fourteen million, four hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •