Base | Representation |
---|---|
bin | 11010001011101000… |
… | …01100111001011001 |
3 | 1100021121020122211102 |
4 | 31011310030321121 |
5 | 212241342322410 |
6 | 10242441241145 |
7 | 1005216564023 |
oct | 150564147131 |
9 | 40247218742 |
10 | 14056214105 |
11 | 5a6340377a |
12 | 28834931b5 |
13 | 143016186b |
14 | 974b4b013 |
15 | 5740392a5 |
hex | 345d0ce59 |
14056214105 has 8 divisors (see below), whose sum is σ = 16893531072. Its totient is φ = 11227588528.
The previous prime is 14056214101. The next prime is 14056214113. The reversal of 14056214105 is 50141265041.
14056214105 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 14056214105 - 22 = 14056214101 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14056214101) 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, 2169287 + ... + 2175756.
It is an arithmetic number, because the mean of its divisors is an integer number (2111691384).
Almost surely, 214056214105 is an apocalyptic number.
It is an amenable number.
14056214105 is a deficient number, since it is larger than the sum of its proper divisors (2837316967).
14056214105 is an equidigital number, since it uses as much as digits as its factorization.
14056214105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4345695.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 14056214105 its reverse (50141265041), we get a palindrome (64197479146).
The spelling of 14056214105 in words is "fourteen billion, fifty-six million, two hundred fourteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •