Base | Representation |
---|---|
bin | 11101010000001001010… |
… | …001001111101001011011 |
3 | 21010011200022100012121001 |
4 | 131100021101033221123 |
5 | 230413342223210021 |
6 | 4135250114525431 |
7 | 265142430600460 |
oct | 35201121175133 |
9 | 7104608305531 |
10 | 2010200210011 |
11 | 705580681614 |
12 | 28570bb96877 |
13 | 11773a8805b6 |
14 | 6d41944b667 |
15 | 37453737091 |
hex | 1d40944fa5b |
2010200210011 has 8 divisors (see below), whose sum is σ = 2303370031104. Its totient is φ = 1718529979560.
The previous prime is 2010200209909. The next prime is 2010200210023. The reversal of 2010200210011 is 1100120020102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010200210011 - 227 = 2010065992283 is a prime.
It is a super-3 number, since 3×20102002100113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2010200210011.
It is not an unprimeable number, because it can be changed into a prime (2010200210911) 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, 374894785 + ... + 374900146.
It is an arithmetic number, because the mean of its divisors is an integer number (287921253888).
Almost surely, 22010200210011 is an apocalyptic number.
2010200210011 is a deficient number, since it is larger than the sum of its proper divisors (293169821093).
2010200210011 is an equidigital number, since it uses as much as digits as its factorization.
2010200210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 749795321.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2010200210011 its reverse (1100120020102), we get a palindrome (3110320230113).
The spelling of 2010200210011 in words is "two trillion, ten billion, two hundred million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •