Base | Representation |
---|---|
bin | 111100110011011… |
… | …000001001010011 |
3 | 2122002111111210001 |
4 | 330303120021103 |
5 | 4042121214303 |
6 | 245120150431 |
7 | 34164500662 |
oct | 7463301123 |
9 | 2562444701 |
10 | 1020101203 |
11 | 483903150 |
12 | 245768417 |
13 | 1334576a4 |
14 | 996a0dd9 |
15 | 5e85231d |
hex | 3ccd8253 |
1020101203 has 8 divisors (see below), whose sum is σ = 1171408320. Its totient is φ = 878555880.
The previous prime is 1020101191. The next prime is 1020101213. The reversal of 1020101203 is 3021010201.
1020101203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020101203 - 229 = 483230291 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1020101203.
It is not an unprimeable number, because it can be changed into a prime (1020101213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2440225 + ... + 2440642.
It is an arithmetic number, because the mean of its divisors is an integer number (146426040).
Almost surely, 21020101203 is an apocalyptic number.
1020101203 is a deficient number, since it is larger than the sum of its proper divisors (151307117).
1020101203 is a wasteful number, since it uses less digits than its factorization.
1020101203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4880897.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1020101203 is about 31939.0232004675. The cubic root of 1020101203 is about 1006.6560003670.
Adding to 1020101203 its reverse (3021010201), we get a palindrome (4041111404).
The spelling of 1020101203 in words is "one billion, twenty million, one hundred one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •