Base | Representation |
---|---|
bin | 1010111011101010101111… |
… | …1000000111110000111011 |
3 | 1120120010020112220121212011 |
4 | 2232322223320013300323 |
5 | 3033414333220010021 |
6 | 41322000555230351 |
7 | 2350300546062304 |
oct | 256725370076073 |
9 | 46503215817764 |
10 | 12020202110011 |
11 | 39148147a8097 |
12 | 14217194483b7 |
13 | 692666c10034 |
14 | 2d7ad0a757ab |
15 | 15ca167b0de1 |
hex | aeeabe07c3b |
12020202110011 has 4 divisors (see below), whose sum is σ = 12020209582024. Its totient is φ = 12020194638000.
The previous prime is 12020202109973. The next prime is 12020202110017. The reversal of 12020202110011 is 11001120202021.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 12020202110011 - 243 = 3224109087803 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12020202109973 and 12020202110000.
It is not an unprimeable number, because it can be changed into a prime (12020202110017) 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, 219930 + ... + 4908031.
It is an arithmetic number, because the mean of its divisors is an integer number (3005052395506).
Almost surely, 212020202110011 is an apocalyptic number.
12020202110011 is a deficient number, since it is larger than the sum of its proper divisors (7472013).
12020202110011 is an equidigital number, since it uses as much as digits as its factorization.
12020202110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7472012.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12020202110011 its reverse (11001120202021), we get a palindrome (23021322312032).
The spelling of 12020202110011 in words is "twelve trillion, twenty billion, two hundred two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •