Base | Representation |
---|---|
bin | 1011110000100011011… |
… | …0101000000000101101 |
3 | 201022102120012220001002 |
4 | 2330020312220000231 |
5 | 11302210033002201 |
6 | 232445242130045 |
7 | 20411021446046 |
oct | 2741066500055 |
9 | 638376186032 |
10 | 202012000301 |
11 | 78744564871 |
12 | 331994b0925 |
13 | 160851086b7 |
14 | 9ac53c18cd |
15 | 53c4e0776b |
hex | 2f08da802d |
202012000301 has 4 divisors (see below), whose sum is σ = 202494129600. Its totient is φ = 201529871004.
The previous prime is 202012000291. The next prime is 202012000369. The reversal of 202012000301 is 103000210202.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202012000301 is a prime.
It is a super-2 number, since 2×2020120003012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202012002301) 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, 241064021 + ... + 241064858.
It is an arithmetic number, because the mean of its divisors is an integer number (50623532400).
Almost surely, 2202012000301 is an apocalyptic number.
It is an amenable number.
202012000301 is a deficient number, since it is larger than the sum of its proper divisors (482129299).
202012000301 is an equidigital number, since it uses as much as digits as its factorization.
202012000301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482129298.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 202012000301 its reverse (103000210202), we get a palindrome (305012210503).
The spelling of 202012000301 in words is "two hundred two billion, twelve million, three hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •