Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0100010100001100110011 |
3 | 1100012010201002100002221200 |
4 | 2110233033010110030303 |
5 | 2314431010002242321 |
6 | 33423315514422243 |
7 | 2103312615542523 |
oct | 224571704241463 |
9 | 40163632302850 |
10 | 10221201212211 |
11 | 3290872688800 |
12 | 1190b2b731983 |
13 | 591b1697c482 |
14 | 2749ccc5d683 |
15 | 12ad2480cd26 |
hex | 94bcf114333 |
10221201212211 has 18 divisors (see below), whose sum is σ = 16228151421300. Its totient is φ = 6194667400680.
The previous prime is 10221201212179. The next prime is 10221201212219. The reversal of 10221201212211 is 11221210212201.
10221201212211 is a `hidden beast` number, since 1 + 0 + 221 + 20 + 1 + 212 + 211 = 666.
It is not a de Polignac number, because 10221201212211 - 25 = 10221201212179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10221201212219) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 4692928761 + ... + 4692930938.
It is an arithmetic number, because the mean of its divisors is an integer number (901563967850).
Almost surely, 210221201212211 is an apocalyptic number.
10221201212211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10221201212211 is a deficient number, since it is larger than the sum of its proper divisors (6006950209089).
10221201212211 is a wasteful number, since it uses less digits than its factorization.
10221201212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9385859727 (or 9385859713 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10221201212211 its reverse (11221210212201), we get a palindrome (21442411424412).
The spelling of 10221201212211 in words is "ten trillion, two hundred twenty-one billion, two hundred one million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •