Base | Representation |
---|---|
bin | 1011110000100000110… |
… | …1000101001111111011 |
3 | 201022101210201121101000 |
4 | 2330020031011033323 |
5 | 11302144241010021 |
6 | 232444212500043 |
7 | 20410530050661 |
oct | 2741015051773 |
9 | 638353647330 |
10 | 202001110011 |
11 | 787393a6828 |
12 | 3319591a623 |
13 | 16082a9483c |
14 | 9ac3b88c31 |
15 | 53c3ea5b26 |
hex | 2f083453fb |
202001110011 has 32 divisors (see below), whose sum is σ = 328707648000. Its totient is φ = 122032700064.
The previous prime is 202001110001. The next prime is 202001110013. The reversal of 202001110011 is 110011100202.
It is a happy number.
It is not a de Polignac number, because 202001110011 - 219 = 202000585723 is a prime.
It is a super-4 number, since 4×2020011100114 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 202001109975 and 202001110002.
It is not an unprimeable number, because it can be changed into a prime (202001110013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8548296 + ... + 8571893.
It is an arithmetic number, because the mean of its divisors is an integer number (10272114000).
Almost surely, 2202001110011 is an apocalyptic number.
202001110011 is a deficient number, since it is larger than the sum of its proper divisors (126706537989).
202001110011 is a wasteful number, since it uses less digits than its factorization.
202001110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17120240 (or 17120234 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 202001110011 its reverse (110011100202), we get a palindrome (312012210213).
The spelling of 202001110011 in words is "two hundred two billion, one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •