Base | Representation |
---|---|
bin | 1011010000010001… |
… | …0001110000101001 |
3 | 21210112120201122002 |
4 | 2310010101300221 |
5 | 22141340121301 |
6 | 1215434540345 |
7 | 134602151033 |
oct | 26404216051 |
9 | 7715521562 |
10 | 3021020201 |
11 | 1310318211 |
12 | 7038976b5 |
13 | 391b64124 |
14 | 209318c53 |
15 | 12a34716b |
hex | b4111c29 |
3021020201 has 4 divisors (see below), whose sum is σ = 3021134292. Its totient is φ = 3020906112.
The previous prime is 3021020137. The next prime is 3021020209. The reversal of 3021020201 is 1020201203.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 2141838400 + 879181801 = 46280^2 + 29651^2 .
It is a cyclic number.
It is not a de Polignac number, because 3021020201 - 26 = 3021020137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3021020209) 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, 5621 + ... + 77933.
It is an arithmetic number, because the mean of its divisors is an integer number (755283573).
Almost surely, 23021020201 is an apocalyptic number.
It is an amenable number.
3021020201 is a deficient number, since it is larger than the sum of its proper divisors (114091).
3021020201 is an equidigital number, since it uses as much as digits as its factorization.
3021020201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114090.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 3021020201 is about 54963.8081013316. The cubic root of 3021020201 is about 1445.6102196346.
Adding to 3021020201 its reverse (1020201203), we get a palindrome (4041221404).
The spelling of 3021020201 in words is "three billion, twenty-one million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •