Base | Representation |
---|---|
bin | 11101111110111001100… |
… | …01101100111001010011 |
3 | 10122111010111022100122211 |
4 | 32333130301230321103 |
5 | 113334323001401321 |
6 | 2105133511012551 |
7 | 134300226501301 |
oct | 16773461547123 |
9 | 3574114270584 |
10 | 1030201200211 |
11 | 3679a67a1697 |
12 | 1477b036a157 |
13 | 761bc248301 |
14 | 37c0d4a7271 |
15 | 1bbe7d850e1 |
hex | efdcc6ce53 |
1030201200211 has 4 divisors (see below), whose sum is σ = 1063433497024. Its totient is φ = 996968903400.
The previous prime is 1030201200191. The next prime is 1030201200227. The reversal of 1030201200211 is 1120021020301.
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 1030201200211 - 223 = 1030192811603 is a prime.
It is a super-2 number, since 2×10302012002112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030201200191 and 1030201200200.
It is not an unprimeable number, because it can be changed into a prime (1030201203211) 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, 16616148360 + ... + 16616148421.
It is an arithmetic number, because the mean of its divisors is an integer number (265858374256).
Almost surely, 21030201200211 is an apocalyptic number.
1030201200211 is a deficient number, since it is larger than the sum of its proper divisors (33232296813).
1030201200211 is an equidigital number, since it uses as much as digits as its factorization.
1030201200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33232296812.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1030201200211 its reverse (1120021020301), we get a palindrome (2150222220512).
The spelling of 1030201200211 in words is "one trillion, thirty billion, two hundred one million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •