Base | Representation |
---|---|
bin | 1010000000011010011001… |
… | …0010100001110100010110 |
3 | 1102221210121022110011100012 |
4 | 2200012212102201310112 |
5 | 2420230001441320042 |
6 | 35222201425120222 |
7 | 2213611541326010 |
oct | 240064622416426 |
9 | 42853538404305 |
10 | 11002201120022 |
11 | 3562009783a72 |
12 | 1298372a89072 |
13 | 61a670458438 |
14 | 2a071ba251b0 |
15 | 1412d4a47e82 |
hex | a01a64a1d16 |
11002201120022 has 16 divisors (see below), whose sum is σ = 19511292627360. Its totient is φ = 4552634946048.
The previous prime is 11002201119947. The next prime is 11002201120037. The reversal of 11002201120022 is 22002110220011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 11002201119979 and 11002201120006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13549508363 + ... + 13549509174.
It is an arithmetic number, because the mean of its divisors is an integer number (1219455789210).
Almost surely, 211002201120022 is an apocalyptic number.
11002201120022 is a deficient number, since it is larger than the sum of its proper divisors (8509091507338).
11002201120022 is a wasteful number, since it uses less digits than its factorization.
11002201120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27099017575.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11002201120022 its reverse (22002110220011), we get a palindrome (33004311340033).
The spelling of 11002201120022 in words is "eleven trillion, two billion, two hundred one million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •