Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …000000101111110100010 |
3 | 10220100222020010120021012 |
4 | 100002200100011332202 |
5 | 121024301222413442 |
6 | 2202202131300522 |
7 | 142426356062036 |
oct | 20024020057642 |
9 | 3810866116235 |
10 | 1102200201122 |
11 | 395493308729 |
12 | 15974474a742 |
13 | 7cc2487a327 |
14 | 3b4bd7981c6 |
15 | 1da0dc0c582 |
hex | 100a0405fa2 |
1102200201122 has 16 divisors (see below), whose sum is σ = 1662493776000. Its totient is φ = 548038560960.
The previous prime is 1102200201097. The next prime is 1102200201143. The reversal of 1102200201122 is 2211020022011.
It is a junction number, because it is equal to n+sod(n) for n = 1102200201097 and 1102200201106.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 10922 + ... + 1484762.
It is an arithmetic number, because the mean of its divisors is an integer number (103905861000).
Almost surely, 21102200201122 is an apocalyptic number.
1102200201122 is a deficient number, since it is larger than the sum of its proper divisors (560293574878).
1102200201122 is a wasteful number, since it uses less digits than its factorization.
1102200201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1475921.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1102200201122 its reverse (2211020022011), we get a palindrome (3313220223133).
The spelling of 1102200201122 in words is "one trillion, one hundred two billion, two hundred million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •