Base | Representation |
---|---|
bin | 110011001110100101… |
… | …0101101010001111101 |
3 | 101111221212010110022010 |
4 | 1212131022231101331 |
5 | 3300300304342341 |
6 | 122312141441433 |
7 | 10643114114025 |
oct | 1463512552175 |
9 | 344855113263 |
10 | 110011012221 |
11 | 42723391820 |
12 | 193a2570279 |
13 | a4b2884406 |
14 | 547884ca85 |
15 | 2cdd070716 |
hex | 199d2ad47d |
110011012221 has 64 divisors (see below), whose sum is σ = 171574640640. Its totient is φ = 61958645760.
The previous prime is 110011012213. The next prime is 110011012271. The reversal of 110011012221 is 122210110011.
It is not a de Polignac number, because 110011012221 - 23 = 110011012213 is a prime.
It is a super-2 number, since 2×1100110122212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110011012197 and 110011012206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011012271) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 54271810 + ... + 54273836.
It is an arithmetic number, because the mean of its divisors is an integer number (2680853760).
Almost surely, 2110011012221 is an apocalyptic number.
110011012221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110011012221 is a deficient number, since it is larger than the sum of its proper divisors (61563628419).
110011012221 is a wasteful number, since it uses less digits than its factorization.
110011012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3234.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110011012221 its reverse (122210110011), we get a palindrome (232221122232).
The spelling of 110011012221 in words is "one hundred ten billion, eleven million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •