Base | Representation |
---|---|
bin | 100000010000110101111… |
… | …0000011110101010101111 |
3 | 120200220111000011110022201 |
4 | 1000201223300132222233 |
5 | 1040122232303320421 |
6 | 13233014433322331 |
7 | 635234650063336 |
oct | 100415360365257 |
9 | 16626430143281 |
10 | 4434214120111 |
11 | 145a5a32a8896 |
12 | 5b74694063a7 |
13 | 2621b58ac859 |
14 | 11488d4bad1d |
15 | 7a52644ab91 |
hex | 4086bc1eaaf |
4434214120111 has 8 divisors (see below), whose sum is σ = 4436009544320. Its totient is φ = 4432418952192.
The previous prime is 4434214120099. The next prime is 4434214120129. The reversal of 4434214120111 is 1110214124344.
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 4434214120111 - 27 = 4434214119983 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4434214120111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4434214121111) 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, 39343906 + ... + 39456448.
It is an arithmetic number, because the mean of its divisors is an integer number (554501193040).
Almost surely, 24434214120111 is an apocalyptic number.
4434214120111 is a deficient number, since it is larger than the sum of its proper divisors (1795424209).
4434214120111 is a wasteful number, since it uses less digits than its factorization.
4434214120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128145.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 4434214120111 its reverse (1110214124344), we get a palindrome (5544428244455).
The spelling of 4434214120111 in words is "four trillion, four hundred thirty-four billion, two hundred fourteen million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •