Base | Representation |
---|---|
bin | 11010001011000001… |
… | …01101010111010011 |
3 | 1100021020122001101002 |
4 | 31011200231113103 |
5 | 212234040313321 |
6 | 10242135532215 |
7 | 1005125262254 |
oct | 150540552723 |
9 | 40236561332 |
10 | 14051104211 |
11 | 5a60533621 |
12 | 288182a06b |
13 | 142c092a61 |
14 | 9741bab2b |
15 | 57387a20b |
hex | 34582d5d3 |
14051104211 has 2 divisors, whose sum is σ = 14051104212. Its totient is φ = 14051104210.
The previous prime is 14051104139. The next prime is 14051104213. The reversal of 14051104211 is 11240115041.
14051104211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14051104211 is a prime.
Together with 14051104213, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14051104213) 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 as a sum of consecutive naturals, namely, 7025552105 + 7025552106.
It is an arithmetic number, because the mean of its divisors is an integer number (7025552106).
Almost surely, 214051104211 is an apocalyptic number.
14051104211 is a deficient number, since it is larger than the sum of its proper divisors (1).
14051104211 is an equidigital number, since it uses as much as digits as its factorization.
14051104211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 20.
Adding to 14051104211 its reverse (11240115041), we get a palindrome (25291219252).
The spelling of 14051104211 in words is "fourteen billion, fifty-one million, one hundred four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •