Base | Representation |
---|---|
bin | 11101100010110010000… |
… | …000110001010001111011 |
3 | 21012002022220101020211111 |
4 | 131202302000301101323 |
5 | 231230333021010021 |
6 | 4152355513541151 |
7 | 266451344463010 |
oct | 35426200612173 |
9 | 7162286336744 |
10 | 2030211110011 |
11 | 71300a2759a7 |
12 | 2895757147b7 |
13 | 1195a95a3626 |
14 | 70396d6d707 |
15 | 37c254078e1 |
hex | 1d8b203147b |
2030211110011 has 8 divisors (see below), whose sum is σ = 2320303568384. Its totient is φ = 1740134226600.
The previous prime is 2030211110009. The next prime is 2030211110029. The reversal of 2030211110011 is 1100111120302.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2030211110011 - 21 = 2030211110009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030211109973 and 2030211110000.
It is not an unprimeable number, because it can be changed into a prime (2030211110051) 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 7 ways as a sum of consecutive naturals, for example, 3613065 + ... + 4136986.
It is an arithmetic number, because the mean of its divisors is an integer number (290037946048).
Almost surely, 22030211110011 is an apocalyptic number.
2030211110011 is a deficient number, since it is larger than the sum of its proper divisors (290092458373).
2030211110011 is an equidigital number, since it uses as much as digits as its factorization.
2030211110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7787481.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 2030211110011 its reverse (1100111120302), we get a palindrome (3130322230313).
The spelling of 2030211110011 in words is "two trillion, thirty billion, two hundred eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •