Base | Representation |
---|---|
bin | 10100100000111111… |
… | …00000101110101110 |
3 | 1001102120222222022101 |
4 | 22100133200232232 |
5 | 140024103123342 |
6 | 5020530405314 |
7 | 536640266116 |
oct | 122037405656 |
9 | 31376888271 |
10 | 11014114222 |
11 | 47421a9041 |
12 | 217473083a |
13 | 1066b29a67 |
14 | 766b06046 |
15 | 446e2b3b7 |
hex | 2907e0bae |
11014114222 has 4 divisors (see below), whose sum is σ = 16521171336. Its totient is φ = 5507057110.
The previous prime is 11014114211. The next prime is 11014114249. The reversal of 11014114222 is 22241141011.
It is a happy number.
11014114222 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 22241141011 = 19 ⋅1170586369.
It is a self number, because there is not a number n which added to its sum of digits gives 11014114222.
It is a congruent number.
It is an unprimeable number.
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, 2753528554 + ... + 2753528557.
It is an arithmetic number, because the mean of its divisors is an integer number (4130292834).
Almost surely, 211014114222 is an apocalyptic number.
11014114222 is a deficient number, since it is larger than the sum of its proper divisors (5507057114).
11014114222 is an equidigital number, since it uses as much as digits as its factorization.
11014114222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5507057113.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11014114222 its reverse (22241141011), we get a palindrome (33255255233).
The spelling of 11014114222 in words is "eleven billion, fourteen million, one hundred fourteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •