Base | Representation |
---|---|
bin | 101101111011110010101110… |
… | …101010000101010100110111 |
3 | 222111022000112200021012200121 |
4 | 231323302232222011110313 |
5 | 202434403013033031403 |
6 | 1553355101030352411 |
7 | 60360352002016120 |
oct | 5573625652052467 |
9 | 874260480235617 |
10 | 202021012002103 |
11 | 594086a2664328 |
12 | 1a7a90381bb707 |
13 | 8895665a7ac98 |
14 | 37c5c24d4d047 |
15 | 185506ba8a3bd |
hex | b7bcaea85537 |
202021012002103 has 8 divisors (see below), whose sum is σ = 240919467729408. Its totient is φ = 165632134063704.
The previous prime is 202021012002091. The next prime is 202021012002157. The reversal of 202021012002103 is 301200210120202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202021012002103 - 25 = 202021012002071 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202021012302103) 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, 627394447051 + ... + 627394447372.
It is an arithmetic number, because the mean of its divisors is an integer number (30114933466176).
Almost surely, 2202021012002103 is an apocalyptic number.
202021012002103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
202021012002103 is a deficient number, since it is larger than the sum of its proper divisors (38898455727305).
202021012002103 is a wasteful number, since it uses less digits than its factorization.
202021012002103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1254788894453.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 202021012002103 its reverse (301200210120202), we get a palindrome (503221222122305).
The spelling of 202021012002103 in words is "two hundred two trillion, twenty-one billion, twelve million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •