Base | Representation |
---|---|
bin | 111100110011000… |
… | …110110011111001 |
3 | 2122002100220101100 |
4 | 330303012303321 |
5 | 4042111431301 |
6 | 245114442013 |
7 | 34164053661 |
oct | 7463066371 |
9 | 2562326340 |
10 | 1020030201 |
11 | 483864873 |
12 | 245733309 |
13 | 133431288 |
14 | 996831a1 |
15 | 5e83b286 |
hex | 3ccc6cf9 |
1020030201 has 24 divisors (see below), whose sum is σ = 1483297920. Its totient is φ = 675459936.
The previous prime is 1020030163. The next prime is 1020030211. The reversal of 1020030201 is 1020300201.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-1020030201 is a prime.
It is a super-2 number, since 2×10200302012 = 2080923221904200802, which contains 22 as substring.
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 (1020030211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1418320 + ... + 1419038.
It is an arithmetic number, because the mean of its divisors is an integer number (61804080).
Almost surely, 21020030201 is an apocalyptic number.
It is an amenable number.
1020030201 is a deficient number, since it is larger than the sum of its proper divisors (463267719).
1020030201 is a wasteful number, since it uses less digits than its factorization.
1020030201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1565 (or 1562 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 1020030201 is about 31937.9116568382. The cubic root of 1020030201 is about 1006.6326444334.
Adding to 1020030201 its reverse (1020300201), we get a palindrome (2040330402).
It can be divided in two parts, 10200 and 30201, that added together give a square (40401 = 2012).
The spelling of 1020030201 in words is "one billion, twenty million, thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •