Base | Representation |
---|---|
bin | 11010100001111001… |
… | …10100000100110111 |
3 | 1100202121202102212102 |
4 | 31100330310010313 |
5 | 213132203133421 |
6 | 10313153212315 |
7 | 1012645452614 |
oct | 152074640467 |
9 | 40677672772 |
10 | 14243021111 |
11 | 60498a5630 |
12 | 2915b6109b |
13 | 145ca79b57 |
14 | 99189750b |
15 | 58563960b |
hex | 350f34137 |
14243021111 has 16 divisors (see below), whose sum is σ = 16232810400. Its totient is φ = 12377904000.
The previous prime is 14243021099. The next prime is 14243021131. The reversal of 14243021111 is 11112034241.
14243021111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-14243021111 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 (14243021131) 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 15 ways as a sum of consecutive naturals, for example, 188816 + ... + 253253.
It is an arithmetic number, because the mean of its divisors is an integer number (1014550650).
Almost surely, 214243021111 is an apocalyptic number.
14243021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14243021111 is a deficient number, since it is larger than the sum of its proper divisors (1989789289).
14243021111 is a wasteful number, since it uses less digits than its factorization.
14243021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442210.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 14243021111 its reverse (11112034241), we get a palindrome (25355055352).
The spelling of 14243021111 in words is "fourteen billion, two hundred forty-three million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.277 sec. • engine limits •