Base | Representation |
---|---|
bin | 111100110011110… |
… | …011000000000001 |
3 | 2122002201002200001 |
4 | 330303303000001 |
5 | 4042133224301 |
6 | 245122400001 |
7 | 34165436452 |
oct | 7463630001 |
9 | 2562632601 |
10 | 1020211201 |
11 | 483978859 |
12 | 245800001 |
13 | 133495789 |
14 | 996cd129 |
15 | 5e874c01 |
hex | 3ccf3001 |
1020211201 has 4 divisors (see below), whose sum is σ = 1030312404. Its totient is φ = 1010110000.
The previous prime is 1020211169. The next prime is 1020211217. The reversal of 1020211201 is 1021120201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 964723600 + 55487601 = 31060^2 + 7449^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020211201 - 25 = 1020211169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020215201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5050450 + ... + 5050651.
It is an arithmetic number, because the mean of its divisors is an integer number (257578101).
Almost surely, 21020211201 is an apocalyptic number.
It is an amenable number.
1020211201 is a deficient number, since it is larger than the sum of its proper divisors (10101203).
1020211201 is a wasteful number, since it uses less digits than its factorization.
1020211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10101202.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1020211201 is about 31940.7451541131. The cubic root of 1020211201 is about 1006.6921817990.
Adding to 1020211201 its reverse (1021120201), we get a palindrome (2041331402).
The spelling of 1020211201 in words is "one billion, twenty million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •