Base | Representation |
---|---|
bin | 11010110110000011… |
… | …10011101100100001 |
3 | 1101012101220122211121 |
4 | 31123001303230201 |
5 | 214003444234213 |
6 | 10342033212241 |
7 | 1020100564231 |
oct | 153301635441 |
9 | 41171818747 |
10 | 14412102433 |
11 | 612628a963 |
12 | 2962701081 |
13 | 1488ac9c81 |
14 | 9aa10bcc1 |
15 | 5953d788d |
hex | 35b073b21 |
14412102433 has 16 divisors (see below), whose sum is σ = 15530356800. Its totient is φ = 13332271680.
The previous prime is 14412102409. The next prime is 14412102449. The reversal of 14412102433 is 33420121441.
14412102433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14412102433 - 25 = 14412102401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14412102398 and 14412102407.
It is not an unprimeable number, because it can be changed into a prime (14412102403) 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 15 ways as a sum of consecutive naturals, for example, 178563 + ... + 246391.
It is an arithmetic number, because the mean of its divisors is an integer number (970647300).
Almost surely, 214412102433 is an apocalyptic number.
It is an amenable number.
14412102433 is a deficient number, since it is larger than the sum of its proper divisors (1118254367).
14412102433 is a wasteful number, since it uses less digits than its factorization.
14412102433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68112.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 14412102433 its reverse (33420121441), we get a palindrome (47832223874).
The spelling of 14412102433 in words is "fourteen billion, four hundred twelve million, one hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •