Base | Representation |
---|---|
bin | 10001100111110110011… |
… | …010101100001011011011 |
3 | 11021202212001210012211002 |
4 | 101213312122230023123 |
5 | 124320132110031021 |
6 | 2324200201255215 |
7 | 153331130113541 |
oct | 21476632541333 |
9 | 4252761705732 |
10 | 1211020002011 |
11 | 427655246776 |
12 | 17685419450b |
13 | 8a2776c6661 |
14 | 42883d23d91 |
15 | 2177c3cb50b |
hex | 119f66ac2db |
1211020002011 has 4 divisors (see below), whose sum is σ = 1212857665800. Its totient is φ = 1209182338224.
The previous prime is 1211020002007. The next prime is 1211020002047. The reversal of 1211020002011 is 1102000201121.
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 1211020002011 - 22 = 1211020002007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1211020001983 and 1211020002001.
It is not an unprimeable number, because it can be changed into a prime (1211020002211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 918830906 + ... + 918832223.
It is an arithmetic number, because the mean of its divisors is an integer number (303214416450).
Almost surely, 21211020002011 is an apocalyptic number.
1211020002011 is a deficient number, since it is larger than the sum of its proper divisors (1837663789).
1211020002011 is an equidigital number, since it uses as much as digits as its factorization.
1211020002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1837663788.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1211020002011 its reverse (1102000201121), we get a palindrome (2313020203132).
The spelling of 1211020002011 in words is "one trillion, two hundred eleven billion, twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •