Base | Representation |
---|---|
bin | 1001100110011000110110… |
… | …10111000111000101100011 |
3 | 2202202010011202110212122202 |
4 | 10303030123113013011203 |
5 | 10231332214131144021 |
6 | 112521522552323415 |
7 | 4306110004262363 |
oct | 463143327070543 |
9 | 82663152425582 |
10 | 21110223303011 |
11 | 67a9882791987 |
12 | 244b3770a356b |
13 | ba18bb10241b |
14 | 52da513b49a3 |
15 | 2691d3103a0b |
hex | 13331b5c7163 |
21110223303011 has 16 divisors (see below), whose sum is σ = 22445091187200. Its totient is φ = 19797802668000.
The previous prime is 21110223303007. The next prime is 21110223303017. The reversal of 21110223303011 is 11030332201112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 21110223303011 - 22 = 21110223303007 is a prime.
It is a super-2 number, since 2×211102233030112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21110223303017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10470806 + ... + 12323076.
It is an arithmetic number, because the mean of its divisors is an integer number (1402818199200).
Almost surely, 221110223303011 is an apocalyptic number.
21110223303011 is a deficient number, since it is larger than the sum of its proper divisors (1334867884189).
21110223303011 is a wasteful number, since it uses less digits than its factorization.
21110223303011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1858330.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 21110223303011 its reverse (11030332201112), we get a palindrome (32140555504123).
The spelling of 21110223303011 in words is "twenty-one trillion, one hundred ten billion, two hundred twenty-three million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •