Base | Representation |
---|---|
bin | 1011110000111000011… |
… | …1100000011111000011 |
3 | 201022122201101120220212 |
4 | 2330032013200133003 |
5 | 11302400134441003 |
6 | 232502115024335 |
7 | 20413143210422 |
oct | 2741607403703 |
9 | 638581346825 |
10 | 202100312003 |
11 | 7878a3a2747 |
12 | 33202b9b0ab |
13 | 1609a4b9045 |
14 | 9ad300d2b9 |
15 | 53cca4ddd8 |
hex | 2f0e1e07c3 |
202100312003 has 16 divisors (see below), whose sum is σ = 207276088320. Its totient is φ = 196988880000.
The previous prime is 202100311997. The next prime is 202100312021. The reversal of 202100312003 is 300213001202.
It is a happy number.
202100312003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 202100312003 - 220 = 202099263427 is a prime.
It is a super-2 number, since 2×2021003120032 (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 (202100318003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3925478 + ... + 3976628.
It is an arithmetic number, because the mean of its divisors is an integer number (12954755520).
Almost surely, 2202100312003 is an apocalyptic number.
202100312003 is a deficient number, since it is larger than the sum of its proper divisors (5175776317).
202100312003 is a wasteful number, since it uses less digits than its factorization.
202100312003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51778.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 202100312003 its reverse (300213001202), we get a palindrome (502313313205).
The spelling of 202100312003 in words is "two hundred two billion, one hundred million, three hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •