Base | Representation |
---|---|
bin | 101101111101001000101011… |
… | …100101010000001111100001 |
3 | 222111121211202112120002111220 |
4 | 231331020223211100033201 |
5 | 202442411020330420223 |
6 | 1553505322541525253 |
7 | 60400130020534236 |
oct | 5575105345201741 |
9 | 874554675502456 |
10 | 202113302201313 |
11 | 59443852011a38 |
12 | 1a802ab3b73829 |
13 | 88a12831c3409 |
14 | 37ca49c08778d |
15 | 185766deee6e3 |
hex | b7d22b9503e1 |
202113302201313 has 16 divisors (see below), whose sum is σ = 270514025274240. Its totient is φ = 134227409112704.
The previous prime is 202113302201281. The next prime is 202113302201323. The reversal of 202113302201313 is 313102203311202.
202113302201313 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 202113302201313 - 25 = 202113302201281 is a prime.
It is not an unprimeable number, because it can be changed into a prime (202113302201323) 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, 41156845 + ... + 45805157.
It is an arithmetic number, because the mean of its divisors is an integer number (16907126579640).
Almost surely, 2202113302201313 is an apocalyptic number.
It is an amenable number.
202113302201313 is a deficient number, since it is larger than the sum of its proper divisors (68400723072927).
202113302201313 is a wasteful number, since it uses less digits than its factorization.
202113302201313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4703688.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 202113302201313 its reverse (313102203311202), we get a palindrome (515215505512515).
The spelling of 202113302201313 in words is "two hundred two trillion, one hundred thirteen billion, three hundred two million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •