Base | Representation |
---|---|
bin | 101101111011101000011110… |
… | …010011011011100110001001 |
3 | 222111020222010020122020011020 |
4 | 231323220132103123212021 |
5 | 202434212440023212223 |
6 | 1553350040221423053 |
7 | 60356512060231641 |
oct | 5573503623334611 |
9 | 874228106566136 |
10 | 202010000210313 |
11 | 59403a61802159 |
12 | 1a7a6a8440aa89 |
13 | 88945cc585359 |
14 | 37c549c68d521 |
15 | 1854b24e6c1e3 |
hex | b7ba1e4db989 |
202010000210313 has 8 divisors (see below), whose sum is σ = 283522807312800. Its totient is φ = 127585263290688.
The previous prime is 202010000210243. The next prime is 202010000210327. The reversal of 202010000210313 is 313012000010202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202010000210313 - 210 = 202010000209289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202010000210292 and 202010000210301.
It is not an unprimeable number, because it can be changed into a prime (202010000210393) 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, 1772017545648 + ... + 1772017545761.
It is an arithmetic number, because the mean of its divisors is an integer number (35440350914100).
Almost surely, 2202010000210313 is an apocalyptic number.
It is an amenable number.
202010000210313 is a deficient number, since it is larger than the sum of its proper divisors (81512807102487).
202010000210313 is a wasteful number, since it uses less digits than its factorization.
202010000210313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3544035091431.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 202010000210313 its reverse (313012000010202), we get a palindrome (515022000220515).
The spelling of 202010000210313 in words is "two hundred two trillion, ten billion, two hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •