Base | Representation |
---|---|
bin | 11010100010000100… |
… | …01100001001100001 |
3 | 1100202201102001002112 |
4 | 31101002030021201 |
5 | 213133033233213 |
6 | 10313243325105 |
7 | 1012663442462 |
oct | 152102141141 |
9 | 40681361075 |
10 | 14244430433 |
11 | 604a678462 |
12 | 2916520795 |
13 | 146015147c |
14 | 991b42d69 |
15 | 585816ea8 |
hex | 35108c261 |
14244430433 has 8 divisors (see below), whose sum is σ = 14485031976. Its totient is φ = 14004057600.
The previous prime is 14244430429. The next prime is 14244430457. The reversal of 14244430433 is 33403444241.
It can be written as a sum of positive squares in 4 ways, for example, as 38651089 + 14205779344 = 6217^2 + 119188^2 .
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 14244430433 - 22 = 14244430429 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14244430433.
It is not an unprimeable number, because it can be changed into a prime (14244430133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70835 + ... + 183047.
It is an arithmetic number, because the mean of its divisors is an integer number (1810628997).
Almost surely, 214244430433 is an apocalyptic number.
It is an amenable number.
14244430433 is a deficient number, since it is larger than the sum of its proper divisors (240601543).
14244430433 is a wasteful number, since it uses less digits than its factorization.
14244430433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114355.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 14244430433 its reverse (33403444241), we get a palindrome (47647874674).
The spelling of 14244430433 in words is "fourteen billion, two hundred forty-four million, four hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •