Base | Representation |
---|---|
bin | 1001010001110101110100… |
… | …1010010100001010010111 |
3 | 1100010022102121102221200122 |
4 | 2110131131022110022113 |
5 | 2314122410220004421 |
6 | 33410441302302155 |
7 | 2102035542560543 |
oct | 224353512241227 |
9 | 40108377387618 |
10 | 10202110313111 |
11 | 3283766337742 |
12 | 11892a212795b |
13 | 590093736782 |
14 | 273adb5c2a23 |
15 | 12a5a87ba2ab |
hex | 9475d294297 |
10202110313111 has 16 divisors (see below), whose sum is σ = 10759894941696. Its totient is φ = 9660313260000.
The previous prime is 10202110313093. The next prime is 10202110313117. The reversal of 10202110313111 is 11131301120201.
It is a cyclic number.
It is not a de Polignac number, because 10202110313111 - 214 = 10202110296727 is a prime.
It is a super-3 number, since 3×102021103131113 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10202110313111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202110313117) 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, 13762085 + ... + 14484446.
It is an arithmetic number, because the mean of its divisors is an integer number (672493433856).
Almost surely, 210202110313111 is an apocalyptic number.
10202110313111 is a deficient number, since it is larger than the sum of its proper divisors (557784628585).
10202110313111 is a wasteful number, since it uses less digits than its factorization.
10202110313111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28246814.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10202110313111 its reverse (11131301120201), we get a palindrome (21333411433312).
The spelling of 10202110313111 in words is "ten trillion, two hundred two billion, one hundred ten million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •