Base | Representation |
---|---|
bin | 1011110000100011001… |
… | …0110011110110001001 |
3 | 201022102111100002011100 |
4 | 2330020302303312021 |
5 | 11302204304001301 |
6 | 232445204452013 |
7 | 20411010112233 |
oct | 2741062636611 |
9 | 638374302140 |
10 | 202011000201 |
11 | 78743a4143a |
12 | 331990aa009 |
13 | 16084b4841a |
14 | 9ac5201253 |
15 | 53c4cab286 |
hex | 2f08cb3d89 |
202011000201 has 24 divisors (see below), whose sum is σ = 296625461184. Its totient is φ = 132444660960.
The previous prime is 202011000199. The next prime is 202011000263. The reversal of 202011000201 is 102000110202.
202011000201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202011000201 - 21 = 202011000199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (202011002201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3787420 + ... + 3840386.
It is an arithmetic number, because the mean of its divisors is an integer number (12359394216).
Almost surely, 2202011000201 is an apocalyptic number.
It is an amenable number.
202011000201 is a deficient number, since it is larger than the sum of its proper divisors (94614460983).
202011000201 is a wasteful number, since it uses less digits than its factorization.
202011000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59981 (or 59978 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 202011000201 its reverse (102000110202), we get a palindrome (304011110403).
The spelling of 202011000201 in words is "two hundred two billion, eleven million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •