Base | Representation |
---|---|
bin | 1001010010010011100111… |
… | …1110101111101100110011 |
3 | 1100011002002010021202211111 |
4 | 2110210321332233230303 |
5 | 2314240301130342321 |
6 | 33414243151454151 |
7 | 2102441021105464 |
oct | 224447176575463 |
9 | 40132063252744 |
10 | 10210110012211 |
11 | 32870a0a1a00a |
12 | 118a955227357 |
13 | 590a69ba2935 |
14 | 274259c0cd6b |
15 | 12a8c5c565e1 |
hex | 94939fafb33 |
10210110012211 has 16 divisors (see below), whose sum is σ = 10763968672800. Its totient is φ = 9657907257600.
The previous prime is 10210110012209. The next prime is 10210110012259. The reversal of 10210110012211 is 11221001101201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10210110012211 - 21 = 10210110012209 is a prime.
It is a super-2 number, since 2×102101100122112 (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 = 10210110012191 and 10210110012200.
It is not an unprimeable number, because it can be changed into a prime (10210110012611) 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, 50142775 + ... + 50345983.
It is an arithmetic number, because the mean of its divisors is an integer number (672748042050).
Almost surely, 210210110012211 is an apocalyptic number.
10210110012211 is a deficient number, since it is larger than the sum of its proper divisors (553858660589).
10210110012211 is a wasteful number, since it uses less digits than its factorization.
10210110012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207270.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10210110012211 its reverse (11221001101201), we get a palindrome (21431111113412).
The spelling of 10210110012211 in words is "ten trillion, two hundred ten billion, one hundred ten million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •