Base | Representation |
---|---|
bin | 11001010000101110000011… |
… | …001011111110101011000101 |
3 | 112120101001211101102020120111 |
4 | 121100232003023332223011 |
5 | 104030231021210014341 |
6 | 1032142405053233021 |
7 | 32254501354322101 |
oct | 3120560313765305 |
9 | 476331741366514 |
10 | 111100120001221 |
11 | 3244432940394a |
12 | 10563b45492771 |
13 | 49cb908ba4070 |
14 | 1d613bb324901 |
15 | cc9e809b9681 |
hex | 650b832feac5 |
111100120001221 has 16 divisors (see below), whose sum is σ = 119877430571136. Its totient is φ = 102355838294976.
The previous prime is 111100120001191. The next prime is 111100120001411. The reversal of 111100120001221 is 122100021001111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 111100120001221 - 237 = 110962681047749 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100120001021) 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, 424283091 + ... + 424544863.
It is an arithmetic number, because the mean of its divisors is an integer number (7492339410696).
Almost surely, 2111100120001221 is an apocalyptic number.
It is an amenable number.
111100120001221 is a deficient number, since it is larger than the sum of its proper divisors (8777310569915).
111100120001221 is a wasteful number, since it uses less digits than its factorization.
111100120001221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324732.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111100120001221 its reverse (122100021001111), we get a palindrome (233200141002332).
The spelling of 111100120001221 in words is "one hundred eleven trillion, one hundred billion, one hundred twenty million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •