Base | Representation |
---|---|
bin | 1001010010111100101000… |
… | …1111010111000000100101 |
3 | 1100012010111102221100012101 |
4 | 2110233022033113000211 |
5 | 2314430323234034341 |
6 | 33423303502452101 |
7 | 2103310613251300 |
oct | 224571217270045 |
9 | 40163442840171 |
10 | 10221120221221 |
11 | 329083099aaa8 |
12 | 1190b08594031 |
13 | 591b02c63000 |
14 | 2749c21b9b37 |
15 | 12ad1c660831 |
hex | 94bca3d7025 |
10221120221221 has 24 divisors (see below), whose sum is σ = 12880246568280. Its totient is φ = 8087040089856.
The previous prime is 10221120221219. The next prime is 10221120221231. The reversal of 10221120221221 is 12212202112201.
It can be written as a sum of positive squares in 4 ways, for example, as 1803514702500 + 8417605518721 = 1342950^2 + 2901311^2 .
It is not a de Polignac number, because 10221120221221 - 21 = 10221120221219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221120221231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47364876 + ... + 47580181.
It is an arithmetic number, because the mean of its divisors is an integer number (536676940345).
Almost surely, 210221120221221 is an apocalyptic number.
It is an amenable number.
10221120221221 is a deficient number, since it is larger than the sum of its proper divisors (2659126347059).
10221120221221 is an frugal number, since it uses more digits than its factorization.
10221120221221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94945110 (or 94945077 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 10221120221221 its reverse (12212202112201), we get a palindrome (22433322333422).
The spelling of 10221120221221 in words is "ten trillion, two hundred twenty-one billion, one hundred twenty million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •