Base | Representation |
---|---|
bin | 101101101101000111001101… |
… | …010111110110000010001011 |
3 | 222100201120122112022202021002 |
4 | 231231013031113312002023 |
5 | 202321341001230000021 |
6 | 1551303422350405215 |
7 | 60224436644334314 |
oct | 5555071527660213 |
9 | 870646575282232 |
10 | 201012210000011 |
11 | 59059888192a43 |
12 | 1a66561a50080b |
13 | 88214a70680a7 |
14 | 378d08591160b |
15 | 1838bc770850b |
hex | b6d1cd5f608b |
201012210000011 has 4 divisors (see below), whose sum is σ = 201013322583024. Its totient is φ = 201011097417000.
The previous prime is 201012209999959. The next prime is 201012210000013. The reversal of 201012210000011 is 110000012210102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201012210000011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201012209999947 and 201012210000001.
It is not an unprimeable number, because it can be changed into a prime (201012210000013) 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, 556020455 + ... + 556381856.
It is an arithmetic number, because the mean of its divisors is an integer number (50253330645756).
Almost surely, 2201012210000011 is an apocalyptic number.
201012210000011 is a deficient number, since it is larger than the sum of its proper divisors (1112583013).
201012210000011 is a wasteful number, since it uses less digits than its factorization.
201012210000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112583012.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201012210000011 its reverse (110000012210102), we get a palindrome (311012222210113).
The spelling of 201012210000011 in words is "two hundred one trillion, twelve billion, two hundred ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •