Base | Representation |
---|---|
bin | 11010111001101010… |
… | …00000011111111001 |
3 | 1101021111201221002002 |
4 | 31130311000133321 |
5 | 214034212121213 |
6 | 10345032350345 |
7 | 1020615352040 |
oct | 153465003771 |
9 | 41244657062 |
10 | 14442301433 |
11 | 614133690a |
12 | 29708453b5 |
13 | 14921416c1 |
14 | 9b012d557 |
15 | 597da0658 |
hex | 35cd407f9 |
14442301433 has 8 divisors (see below), whose sum is σ = 16540834752. Its totient is φ = 12352604976.
The previous prime is 14442301429. The next prime is 14442301463. The reversal of 14442301433 is 33410324441.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14442301433 - 22 = 14442301429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14442301396 and 14442301405.
It is not an unprimeable number, because it can be changed into a prime (14442301463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2205710 + ... + 2212247.
It is an arithmetic number, because the mean of its divisors is an integer number (2067604344).
Almost surely, 214442301433 is an apocalyptic number.
It is an amenable number.
14442301433 is a deficient number, since it is larger than the sum of its proper divisors (2098533319).
14442301433 is an equidigital number, since it uses as much as digits as its factorization.
14442301433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4418431.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 14442301433 its reverse (33410324441), we get a palindrome (47852625874).
The spelling of 14442301433 in words is "fourteen billion, four hundred forty-two million, three hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •