Base | Representation |
---|---|
bin | 1001100011011110001011… |
… | …01010001000110000100011 |
3 | 2202101112111002220122101111 |
4 | 10301233011222020300203 |
5 | 10223211440301432321 |
6 | 112403510013044151 |
7 | 4265631262420600 |
oct | 461570552106043 |
9 | 82345432818344 |
10 | 21010001202211 |
11 | 6770322a491aa |
12 | 2433a66a86657 |
13 | b9530859acb8 |
14 | 528c64a5b6a7 |
15 | 2667b96465e1 |
hex | 131bc5a88c23 |
21010001202211 has 24 divisors (see below), whose sum is σ = 24658644983040. Its totient is φ = 17848232578512.
The previous prime is 21010001202191. The next prime is 21010001202251. The reversal of 21010001202211 is 11220210001012.
It is not a de Polignac number, because 21010001202211 - 241 = 18810977946659 is a prime.
It is a super-2 number, since 2×210100012022112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010001202191 and 21010001202200.
It is not an unprimeable number, because it can be changed into a prime (21010001202251) 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, 796351 + ... + 6531016.
It is an arithmetic number, because the mean of its divisors is an integer number (1027443540960).
Almost surely, 221010001202211 is an apocalyptic number.
21010001202211 is a deficient number, since it is larger than the sum of its proper divisors (3648643780829).
21010001202211 is a wasteful number, since it uses less digits than its factorization.
21010001202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7327903 (or 7327896 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21010001202211 its reverse (11220210001012), we get a palindrome (32230211203223).
The spelling of 21010001202211 in words is "twenty-one trillion, ten billion, one million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •