Base | Representation |
---|---|
bin | 1100001110011000101… |
… | …1001011011010001011 |
3 | 202002002122220112100111 |
4 | 3003212023023122023 |
5 | 11420110122321303 |
6 | 240252032015151 |
7 | 21113331365305 |
oct | 3034613133213 |
9 | 662078815314 |
10 | 210020120203 |
11 | 81083978883 |
12 | 348533914b7 |
13 | 16a6023269a |
14 | a244ba0975 |
15 | 56e2ea8b6d |
hex | 30e62cb68b |
210020120203 has 32 divisors (see below), whose sum is σ = 223917926400. Its totient is φ = 196430572800.
The previous prime is 210020120117. The next prime is 210020120209. The reversal of 210020120203 is 302021020012.
210020120203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210020120203 - 29 = 210020119691 is a prime.
It is a super-2 number, since 2×2100201202032 (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 (210020120209) 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 31 ways as a sum of consecutive naturals, for example, 498859933 + ... + 498860353.
It is an arithmetic number, because the mean of its divisors is an integer number (6997435200).
Almost surely, 2210020120203 is an apocalyptic number.
210020120203 is a deficient number, since it is larger than the sum of its proper divisors (13897806197).
210020120203 is a wasteful number, since it uses less digits than its factorization.
210020120203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 210020120203 its reverse (302021020012), we get a palindrome (512041140215).
The spelling of 210020120203 in words is "two hundred ten billion, twenty million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •