Base | Representation |
---|---|
bin | 101111111110011110000001… |
… | …011100101001001100001011 |
3 | 1000200002111112120122021010221 |
4 | 233332132001130221030023 |
5 | 210124020102202321303 |
6 | 2024432311324050511 |
7 | 62305215140421061 |
oct | 5776360134511413 |
9 | 1020074476567127 |
10 | 211001030120203 |
11 | 61260041798874 |
12 | 1b7b94b6093a37 |
13 | 9097408c379cb |
14 | 3a1670bd08031 |
15 | 195d94adc94bd |
hex | bfe78172930b |
211001030120203 has 4 divisors (see below), whose sum is σ = 211062961743840. Its totient is φ = 210939098496568.
The previous prime is 211001030120189. The next prime is 211001030120219. The reversal of 211001030120203 is 302021030100112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211001030120203 - 25 = 211001030120171 is a prime.
It is a super-2 number, since 2×2110010301202032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211001030180203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30965806708 + ... + 30965813521.
It is an arithmetic number, because the mean of its divisors is an integer number (52765740435960).
Almost surely, 2211001030120203 is an apocalyptic number.
211001030120203 is a deficient number, since it is larger than the sum of its proper divisors (61931623637).
211001030120203 is an equidigital number, since it uses as much as digits as its factorization.
211001030120203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61931623636.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 211001030120203 its reverse (302021030100112), we get a palindrome (513022060220315).
The spelling of 211001030120203 in words is "two hundred eleven trillion, one billion, thirty million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •