Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0010010001110010001101 |
3 | 1100011011102121122221100221 |
4 | 2110211300102101302031 |
5 | 2314244132400232341 |
6 | 33414513415351341 |
7 | 2102502423203542 |
oct | 224456022216215 |
9 | 40134377587327 |
10 | 10211021102221 |
11 | 3287519236465 |
12 | 118ab6a382551 |
13 | 590b83880054 |
14 | 274304c14bc9 |
15 | 12a92ac23ed1 |
hex | 94970491c8d |
10211021102221 has 32 divisors (see below), whose sum is σ = 11181426057216. Its totient is φ = 9295023672000.
The previous prime is 10211021102153. The next prime is 10211021102239. The reversal of 10211021102221 is 12220112011201.
It is a de Polignac number, because none of the positive numbers 2k-10211021102221 is a prime.
It is a super-2 number, since 2×102110211022212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10211021102195 and 10211021102204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211021102281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 222095766 + ... + 222141736.
It is an arithmetic number, because the mean of its divisors is an integer number (349419564288).
Almost surely, 210211021102221 is an apocalyptic number.
It is an amenable number.
10211021102221 is a deficient number, since it is larger than the sum of its proper divisors (970404954995).
10211021102221 is a wasteful number, since it uses less digits than its factorization.
10211021102221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51193.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10211021102221 its reverse (12220112011201), we get a palindrome (22431133113422).
The spelling of 10211021102221 in words is "ten trillion, two hundred eleven billion, twenty-one million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •