Base | Representation |
---|---|
bin | 110011101100000101… |
… | …1001101100100011101 |
3 | 101121111211222001112100 |
4 | 1213120023031210131 |
5 | 3304312224001341 |
6 | 122554304355313 |
7 | 11006464635306 |
oct | 1473013154435 |
9 | 347454861470 |
10 | 111001000221 |
11 | 43091197421 |
12 | 1961a015b39 |
13 | a60c9c7427 |
14 | 55301117ad |
15 | 2d49e253b6 |
hex | 19d82cd91d |
111001000221 has 12 divisors (see below), whose sum is σ = 164668150972. Its totient is φ = 72000648576.
The previous prime is 111001000211. The next prime is 111001000241. The reversal of 111001000221 is 122000100111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 81824602500 + 29176397721 = 286050^2 + 170811^2 .
It is not a de Polignac number, because 111001000221 - 222 = 110996805917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111001000211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 166667836 + ... + 166668501.
Almost surely, 2111001000221 is an apocalyptic number.
It is an amenable number.
111001000221 is a deficient number, since it is larger than the sum of its proper divisors (53667150751).
111001000221 is a wasteful number, since it uses less digits than its factorization.
111001000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333336380 (or 333336377 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111001000221 its reverse (122000100111), we get a palindrome (233001100332).
The spelling of 111001000221 in words is "one hundred eleven billion, one million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •