Base | Representation |
---|---|
bin | 1001101001100111011000… |
… | …01100110011010010010010 |
3 | 2210010201101000211201010021 |
4 | 10310303230030303102102 |
5 | 10240141303403033020 |
6 | 113044501143054054 |
7 | 4320113446111465 |
oct | 464635414632222 |
9 | 83121330751107 |
10 | 21221101221010 |
11 | 6841900451859 |
12 | 246895ba4132a |
13 | bac1ab463a22 |
14 | 53516d0072dc |
15 | 26c0223151aa |
hex | 134cec333492 |
21221101221010 has 8 divisors (see below), whose sum is σ = 38197982197836. Its totient is φ = 8488440488400.
The previous prime is 21221101221007. The next prime is 21221101221013. The reversal of 21221101221010 is 1012210112212.
It is an interprime number because it is at equal distance from previous prime (21221101221007) and next prime (21221101221013).
It can be written as a sum of positive squares in 2 ways, for example, as 19794588690321 + 1426512530689 = 4449111^2 + 1194367^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×212211012210102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21221101221013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1061055061041 + ... + 1061055061060.
Almost surely, 221221101221010 is an apocalyptic number.
21221101221010 is a deficient number, since it is larger than the sum of its proper divisors (16976880976826).
21221101221010 is a wasteful number, since it uses less digits than its factorization.
21221101221010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2122110122108.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21221101221010 its reverse (1012210112212), we get a palindrome (22233311333222).
The spelling of 21221101221010 in words is "twenty-one trillion, two hundred twenty-one billion, one hundred one million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •