Base | Representation |
---|---|
bin | 1001010010111100111110… |
… | …1010000010001101100001 |
3 | 1100012010201202221110110010 |
4 | 2110233033222002031201 |
5 | 2314431020020200001 |
6 | 33423320510355133 |
7 | 2103313065564066 |
oct | 224571752021541 |
9 | 40163652843403 |
10 | 10221211100001 |
11 | 3290878221630 |
12 | 1190b32abbaa9 |
13 | 591b18a31c35 |
14 | 2749d02b4c6d |
15 | 12ad256128d6 |
hex | 94bcfa82361 |
10221211100001 has 16 divisors (see below), whose sum is σ = 15014416310208. Its totient is φ = 6133339992000.
The previous prime is 10221211099943. The next prime is 10221211100011. The reversal of 10221211100001 is 10000111212201.
It is not a de Polignac number, because 10221211100001 - 213 = 10221211091809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10221211100001.
It is not an unprimeable number, because it can be changed into a prime (10221211100011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1533331666 + ... + 1533338331.
It is an arithmetic number, because the mean of its divisors is an integer number (938401019388).
Almost surely, 210221211100001 is an apocalyptic number.
10221211100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10221211100001 is a deficient number, since it is larger than the sum of its proper divisors (4793205210207).
10221211100001 is a wasteful number, since it uses less digits than its factorization.
10221211100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3066670112.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10221211100001 its reverse (10000111212201), we get a palindrome (20221322312202).
The spelling of 10221211100001 in words is "ten trillion, two hundred twenty-one billion, two hundred eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •