Base | Representation |
---|---|
bin | 101101111011100001000111… |
… | …100010001110011110101011 |
3 | 222111020012201210210120220111 |
4 | 231323201013202032132223 |
5 | 202434100301104120021 |
6 | 1553342252400035151 |
7 | 60356112253562026 |
oct | 5573410742163653 |
9 | 874205653716814 |
10 | 202002102020011 |
11 | 59400679451957 |
12 | 1a7a543b302ab7 |
13 | 889394116a677 |
14 | 37c4d4d7281bd |
15 | 18548118828e1 |
hex | b7b84788e7ab |
202002102020011 has 4 divisors (see below), whose sum is σ = 202107696429672. Its totient is φ = 201896507610352.
The previous prime is 202002102019909. The next prime is 202002102020029. The reversal of 202002102020011 is 110020201200202.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 202002102020011 - 215 = 202002101987243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202002102019973 and 202002102020000.
It is not an unprimeable number, because it can be changed into a prime (202002162020011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52797201961 + ... + 52797205786.
It is an arithmetic number, because the mean of its divisors is an integer number (50526924107418).
Almost surely, 2202002102020011 is an apocalyptic number.
202002102020011 is a deficient number, since it is larger than the sum of its proper divisors (105594409661).
202002102020011 is a wasteful number, since it uses less digits than its factorization.
202002102020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105594409660.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202002102020011 its reverse (110020201200202), we get a palindrome (312022303220213).
The spelling of 202002102020011 in words is "two hundred two trillion, two billion, one hundred two million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •