Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …001011111111000110101001 |
3 | 222101001002101002120022212101 |
4 | 231232122012023333012221 |
5 | 202324320234231203223 |
6 | 1551412342010013401 |
7 | 60234040312132066 |
oct | 5556320613770651 |
9 | 871032332508771 |
10 | 201101210022313 |
11 | 590935a93a5a87 |
12 | 1a67a918417261 |
13 | 88299bb95a393 |
14 | 37934c9aa9c6d |
15 | 183b185daa4ad |
hex | b6e6862ff1a9 |
201101210022313 has 16 divisors (see below), whose sum is σ = 215098218873216. Its totient is φ = 187353895737600.
The previous prime is 201101210022311. The next prime is 201101210022329. The reversal of 201101210022313 is 313220012101102.
It is a cyclic number.
It is not a de Polignac number, because 201101210022313 - 21 = 201101210022311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201101210022311) 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, 137685106 + ... + 139138027.
It is an arithmetic number, because the mean of its divisors is an integer number (13443638679576).
Almost surely, 2201101210022313 is an apocalyptic number.
It is an amenable number.
201101210022313 is a deficient number, since it is larger than the sum of its proper divisors (13997008850903).
201101210022313 is a wasteful number, since it uses less digits than its factorization.
201101210022313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276823584.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 201101210022313 its reverse (313220012101102), we get a palindrome (514321222123415).
The spelling of 201101210022313 in words is "two hundred one trillion, one hundred one billion, two hundred ten million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •