Base | Representation |
---|---|
bin | 11010111001110000… |
… | …01011100001101001 |
3 | 1101021120022011211002 |
4 | 31130320023201221 |
5 | 214034420224113 |
6 | 10345102244345 |
7 | 1020625414400 |
oct | 153470134151 |
9 | 41246264732 |
10 | 14443133033 |
11 | 614185468a |
12 | 2970b866b5 |
13 | 1492373084 |
14 | 9b02a8637 |
15 | 597eb6c58 |
hex | 35ce0b869 |
14443133033 has 24 divisors (see below), whose sum is σ = 17056579680. Its totient is φ = 12192586560.
The previous prime is 14443133021. The next prime is 14443133057. The reversal of 14443133033 is 33033134441.
14443133033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14443133033 - 210 = 14443132009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14443132987 and 14443133005.
It is not an unprimeable number, because it can be changed into a prime (14443133093) 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, 1340813 + ... + 1351541.
It is an arithmetic number, because the mean of its divisors is an integer number (710690820).
Almost surely, 214443133033 is an apocalyptic number.
It is an amenable number.
14443133033 is a deficient number, since it is larger than the sum of its proper divisors (2613446647).
14443133033 is a wasteful number, since it uses less digits than its factorization.
14443133033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11157 (or 11150 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 14443133033 its reverse (33033134441), we get a palindrome (47476267474).
The spelling of 14443133033 in words is "fourteen billion, four hundred forty-three million, one hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •