Base | Representation |
---|---|
bin | 101111101111111011100111… |
… | …110011100011011011111011 |
3 | 1000112112222220211220001122211 |
4 | 233233323213303203123323 |
5 | 210011133114111201021 |
6 | 2022345332434355551 |
7 | 62143100552614120 |
oct | 5757734763433373 |
9 | 1015488824801584 |
10 | 210002020022011 |
11 | 60a053a1619848 |
12 | 1b67796b72bbb7 |
13 | 902414aa81ba9 |
14 | 39c021b140747 |
15 | 194297b4ec3e1 |
hex | befee7ce36fb |
210002020022011 has 8 divisors (see below), whose sum is σ = 242126222832864. Its totient is φ = 178408795770240.
The previous prime is 210002020022009. The next prime is 210002020022017. The reversal of 210002020022011 is 110220020200012.
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 210002020022011 - 21 = 210002020022009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210002020021982 and 210002020022000.
It is not an unprimeable number, because it can be changed into a prime (210002020022017) 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, 132744638920 + ... + 132744640501.
It is an arithmetic number, because the mean of its divisors is an integer number (30265777854108).
Almost surely, 2210002020022011 is an apocalyptic number.
210002020022011 is a deficient number, since it is larger than the sum of its proper divisors (32124202810853).
210002020022011 is a wasteful number, since it uses less digits than its factorization.
210002020022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265489279541.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 210002020022011 its reverse (110220020200012), we get a palindrome (320222040222023).
The spelling of 210002020022011 in words is "two hundred ten trillion, two billion, twenty million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •