Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …111000010010010010011 |
3 | 10220100222100120000200111 |
4 | 100002200113002102103 |
5 | 121024302204133021 |
6 | 2202202234302151 |
7 | 142426410411610 |
oct | 20024027022223 |
9 | 3810870500614 |
10 | 1102202021011 |
11 | 395494340a73 |
12 | 159745287957 |
13 | 7cc250667a0 |
14 | 3b4bdb0d507 |
15 | 1da0de6b8e1 |
hex | 100a05c2493 |
1102202021011 has 16 divisors (see below), whose sum is σ = 1376803450624. Its totient is φ = 859055925024.
The previous prime is 1102202020999. The next prime is 1102202021027. The reversal of 1102202021011 is 1101202022011.
It is a cyclic number.
It is not a de Polignac number, because 1102202021011 - 27 = 1102202020883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1102202020982 and 1102202021000.
It is not an unprimeable number, because it can be changed into a prime (1102202021311) 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 15 ways as a sum of consecutive naturals, for example, 90382785 + ... + 90394978.
It is an arithmetic number, because the mean of its divisors is an integer number (86050215664).
Almost surely, 21102202021011 is an apocalyptic number.
1102202021011 is a deficient number, since it is larger than the sum of its proper divisors (274601429613).
1102202021011 is a wasteful number, since it uses less digits than its factorization.
1102202021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180777850.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1102202021011 its reverse (1101202022011), we get a palindrome (2203404043022).
The spelling of 1102202021011 in words is "one trillion, one hundred two billion, two hundred two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •