Base | Representation |
---|---|
bin | 1011110000100011011… |
… | …1000000101001010011 |
3 | 201022102120102000110012 |
4 | 2330020313000221103 |
5 | 11302210044214303 |
6 | 232445244225135 |
7 | 20411022346163 |
oct | 2741067005123 |
9 | 638376360405 |
10 | 202012101203 |
11 | 78744623660 |
12 | 3319953b1ab |
13 | 160851425c3 |
14 | 9ac540a5a3 |
15 | 53c4e275d8 |
hex | 2f08dc0a53 |
202012101203 has 8 divisors (see below), whose sum is σ = 226332968880. Its totient is φ = 178683922080.
The previous prime is 202012101139. The next prime is 202012101223. The reversal of 202012101203 is 302101210202.
It is a happy number.
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 202012101203 - 26 = 202012101139 is a prime.
It is a super-2 number, since 2×2020121012032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202012101223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248171708 + ... + 248172521.
It is an arithmetic number, because the mean of its divisors is an integer number (28291621110).
Almost surely, 2202012101203 is an apocalyptic number.
202012101203 is a deficient number, since it is larger than the sum of its proper divisors (24320867677).
202012101203 is a wasteful number, since it uses less digits than its factorization.
202012101203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496344277.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 202012101203 its reverse (302101210202), we get a palindrome (504113311405).
The spelling of 202012101203 in words is "two hundred two billion, twelve million, one hundred one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •