Base | Representation |
---|---|
bin | 11010010010011010… |
… | …01111101111111001 |
3 | 1100102120022022202001 |
4 | 31021031033233321 |
5 | 212400424023113 |
6 | 10252232541001 |
7 | 1006510315210 |
oct | 151115175771 |
9 | 40376268661 |
10 | 14113111033 |
11 | 5a9253522a |
12 | 289a551761 |
13 | 143bb93298 |
14 | 97c51c077 |
15 | 5790277dd |
hex | 34934fbf9 |
14113111033 has 16 divisors (see below), whose sum is σ = 16292655360. Its totient is φ = 11974910976.
The previous prime is 14113111027. The next prime is 14113111063. The reversal of 14113111033 is 33011131141.
It is a happy number.
It is not a de Polignac number, because 14113111033 - 221 = 14111013881 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 14113111033.
It is not an unprimeable number, because it can be changed into a prime (14113111013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 323785 + ... + 364777.
It is an arithmetic number, because the mean of its divisors is an integer number (1018290960).
Almost surely, 214113111033 is an apocalyptic number.
It is an amenable number.
14113111033 is a deficient number, since it is larger than the sum of its proper divisors (2179544327).
14113111033 is a wasteful number, since it uses less digits than its factorization.
14113111033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41496.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 14113111033 its reverse (33011131141), we get a palindrome (47124242174).
The spelling of 14113111033 in words is "fourteen billion, one hundred thirteen million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •