Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1100010000111010001011 |
3 | 1100012010110210121221010200 |
4 | 2110233021230100322023 |
5 | 2314430313410134240 |
6 | 33423302533343243 |
7 | 2103310442123124 |
oct | 224571154207213 |
9 | 40163423557120 |
10 | 10221111021195 |
11 | 3290826786978 |
12 | 1190b05497b23 |
13 | 591b010915c9 |
14 | 2749c0ca304b |
15 | 12ad1b944930 |
hex | 94bc9b10e8b |
10221111021195 has 24 divisors (see below), whose sum is σ = 17726506729776. Its totient is φ = 5448208659648.
The previous prime is 10221111021181. The next prime is 10221111021197. The reversal of 10221111021195 is 59112011112201.
It is not a de Polignac number, because 10221111021195 - 29 = 10221111020683 is a prime.
It is a super-2 number, since 2×102211110211952 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10221111021197) 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, 63471852 + ... + 63632681.
It is an arithmetic number, because the mean of its divisors is an integer number (738604447074).
Almost surely, 210221111021195 is an apocalyptic number.
10221111021195 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10221111021195 is a deficient number, since it is larger than the sum of its proper divisors (7505395708581).
10221111021195 is a wasteful number, since it uses less digits than its factorization.
10221111021195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127106331 (or 127106328 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 27.
Adding to 10221111021195 its reverse (59112011112201), we get a palindrome (69333122133396).
The spelling of 10221111021195 in words is "ten trillion, two hundred twenty-one billion, one hundred eleven million, twenty-one thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •