Base | Representation |
---|---|
bin | 11010000111011100… |
… | …10000110010110011 |
3 | 1100012011011211010122 |
4 | 31003232100302303 |
5 | 212203400242041 |
6 | 10235144520455 |
7 | 1004312256434 |
oct | 150356206263 |
9 | 40164154118 |
10 | 14021102771 |
11 | 5a45602045 |
12 | 287378012b |
13 | 1425aba220 |
14 | 97020b48b |
15 | 570e00c4b |
hex | 343b90cb3 |
14021102771 has 4 divisors (see below), whose sum is σ = 15099649152. Its totient is φ = 12942556392.
The previous prime is 14021102761. The next prime is 14021102807. The reversal of 14021102771 is 17720112041.
14021102771 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14021102771 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 14021102771.
It is not an unprimeable number, because it can be changed into a prime (14021102741) 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 3 ways as a sum of consecutive naturals, for example, 539273171 + ... + 539273196.
It is an arithmetic number, because the mean of its divisors is an integer number (3774912288).
Almost surely, 214021102771 is an apocalyptic number.
14021102771 is a deficient number, since it is larger than the sum of its proper divisors (1078546381).
14021102771 is a wasteful number, since it uses less digits than its factorization.
14021102771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1078546380.
The product of its (nonzero) digits is 784, while the sum is 26.
The spelling of 14021102771 in words is "fourteen billion, twenty-one million, one hundred two thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •