Base | Representation |
---|---|
bin | 110011101100101101… |
… | …1010100100001011101 |
3 | 101121120022110222010010 |
4 | 1213121123110201131 |
5 | 3304333113001341 |
6 | 123000334433433 |
7 | 11010141300636 |
oct | 1473133244135 |
9 | 347508428103 |
10 | 111022000221 |
11 | 430a202aaa0 |
12 | 19625062879 |
13 | a61416aa72 |
14 | 5532c1a88d |
15 | 2d4bbc2716 |
hex | 19d96d485d |
111022000221 has 16 divisors (see below), whose sum is σ = 161761678848. Its totient is φ = 67171422000.
The previous prime is 111022000189. The next prime is 111022000231. The reversal of 111022000221 is 122000220111.
It is not a de Polignac number, because 111022000221 - 25 = 111022000189 is a prime.
It is a super-3 number, since 3×1110220002213 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111022000197 and 111022000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111022000231) 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, 2846305 + ... + 2885046.
It is an arithmetic number, because the mean of its divisors is an integer number (10110104928).
Almost surely, 2111022000221 is an apocalyptic number.
111022000221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111022000221 is a deficient number, since it is larger than the sum of its proper divisors (50739678627).
111022000221 is a wasteful number, since it uses less digits than its factorization.
111022000221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5731952.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 111022000221 its reverse (122000220111), we get a palindrome (233022220332).
The spelling of 111022000221 in words is "one hundred eleven billion, twenty-two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •