Base | Representation |
---|---|
bin | 1001010010011111001101… |
… | …1110011110000000011111 |
3 | 1100011101010000020212222012 |
4 | 2110213303132132000133 |
5 | 2314313134330111221 |
6 | 33415520042541435 |
7 | 2102611110403520 |
oct | 224476336360037 |
9 | 40141100225865 |
10 | 10213222113311 |
11 | 3288448696698 |
12 | 118b48350787b |
13 | 591144876989 |
14 | 274473276847 |
15 | 12aa0909065b |
hex | 949f379e01f |
10213222113311 has 8 divisors (see below), whose sum is σ = 11682894011040. Its totient is φ = 8746210257408.
The previous prime is 10213222113173. The next prime is 10213222113337. The reversal of 10213222113311 is 11331122231201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10213222113311 is a prime.
It is a super-3 number, since 3×102132221133113 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213222113361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 665002226 + ... + 665017583.
It is an arithmetic number, because the mean of its divisors is an integer number (1460361751380).
Almost surely, 210213222113311 is an apocalyptic number.
10213222113311 is a deficient number, since it is larger than the sum of its proper divisors (1469671897729).
10213222113311 is a wasteful number, since it uses less digits than its factorization.
10213222113311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1330020913.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 10213222113311 its reverse (11331122231201), we get a palindrome (21544344344512).
The spelling of 10213222113311 in words is "ten trillion, two hundred thirteen billion, two hundred twenty-two million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •