Base | Representation |
---|---|
bin | 11010110110001100… |
… | …11011100000000111 |
3 | 1101012111012012212111 |
4 | 31123012123200013 |
5 | 214004302022210 |
6 | 10342115201451 |
7 | 1020114101530 |
oct | 153306334007 |
9 | 41174165774 |
10 | 14413314055 |
11 | 6126a381a8 |
12 | 2962ba6287 |
13 | 14891325ca |
14 | 9aa345687 |
15 | 59557688a |
hex | 35b19b807 |
14413314055 has 8 divisors (see below), whose sum is σ = 19766830752. Its totient is φ = 9883415328.
The previous prime is 14413314049. The next prime is 14413314059. The reversal of 14413314055 is 55041331441.
14413314055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 14413314055 - 211 = 14413312007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14413314059) 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 7 ways as a sum of consecutive naturals, for example, 205904452 + ... + 205904521.
It is an arithmetic number, because the mean of its divisors is an integer number (2470853844).
Almost surely, 214413314055 is an apocalyptic number.
14413314055 is a deficient number, since it is larger than the sum of its proper divisors (5353516697).
14413314055 is an equidigital number, since it uses as much as digits as its factorization.
14413314055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411808985.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 14413314055 its reverse (55041331441), we get a palindrome (69454645496).
The spelling of 14413314055 in words is "fourteen billion, four hundred thirteen million, three hundred fourteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •