Base | Representation |
---|---|
bin | 10000000010010101100… |
… | …001000100000001110011 |
3 | 10220100111200020111021002 |
4 | 100002111201010001303 |
5 | 121023414121201321 |
6 | 2202132215152215 |
7 | 142422041203352 |
oct | 20022541040163 |
9 | 3810450214232 |
10 | 1102020100211 |
11 | 3954006871a8 |
12 | 1596b437566b |
13 | 7cbc646c544 |
14 | 3b4a38b5999 |
15 | 1d9eced420b |
hex | 10095844073 |
1102020100211 has 4 divisors (see below), whose sum is σ = 1112319353592. Its totient is φ = 1091720846832.
The previous prime is 1102020100127. The next prime is 1102020100297. The reversal of 1102020100211 is 1120010202011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102020100211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102020100192 and 1102020100201.
It is not an unprimeable number, because it can be changed into a prime (1102020103211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5149626530 + ... + 5149626743.
It is an arithmetic number, because the mean of its divisors is an integer number (278079838398).
Almost surely, 21102020100211 is an apocalyptic number.
1102020100211 is a deficient number, since it is larger than the sum of its proper divisors (10299253381).
1102020100211 is a wasteful number, since it uses less digits than its factorization.
1102020100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10299253380.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1102020100211 its reverse (1120010202011), we get a palindrome (2222030302222).
The spelling of 1102020100211 in words is "one trillion, one hundred two billion, twenty million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •