Base | Representation |
---|---|
bin | 101101101101000101010101… |
… | …101000001010011100101011 |
3 | 222100201101110112001120211010 |
4 | 231231011111220022130223 |
5 | 202321322342424341021 |
6 | 1551302451143035003 |
7 | 60224336111246406 |
oct | 5555052550123453 |
9 | 870641415046733 |
10 | 201010201012011 |
11 | 59058a47167586 |
12 | 1a66515973ba63 |
13 | 8821246a949b1 |
14 | 378cd34b96d3d |
15 | 1838b0b16c976 |
hex | b6d155a0a72b |
201010201012011 has 8 divisors (see below), whose sum is σ = 268131825267264. Its totient is φ = 133947688715720.
The previous prime is 201010201012007. The next prime is 201010201012021. The reversal of 201010201012011 is 110210102010102.
201010201012011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 201010201012011 - 22 = 201010201012007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201010201012021) 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, 14777981805 + ... + 14777995406.
It is an arithmetic number, because the mean of its divisors is an integer number (33516478158408).
Almost surely, 2201010201012011 is an apocalyptic number.
201010201012011 is a deficient number, since it is larger than the sum of its proper divisors (67121624255253).
201010201012011 is a wasteful number, since it uses less digits than its factorization.
201010201012011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29555979481.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201010201012011 its reverse (110210102010102), we get a palindrome (311220303022113).
The spelling of 201010201012011 in words is "two hundred one trillion, ten billion, two hundred one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •