Base | Representation |
---|---|
bin | 1010000001100000100000… |
… | …0100010000001010000110 |
3 | 1110000121011221011011012010 |
4 | 2200120020010100022012 |
5 | 2421032022440222042 |
6 | 35234553133235050 |
7 | 2215146120226554 |
oct | 240301004201206 |
9 | 43017157134163 |
10 | 11021021414022 |
11 | 3569a972a8454 |
12 | 129bb45932a86 |
13 | 61c37c5c5a89 |
14 | 2a15c5380bd4 |
15 | 141a36e3659c |
hex | a0608110286 |
11021021414022 has 16 divisors (see below), whose sum is σ = 22579653629232. Its totient is φ = 3584072004480.
The previous prime is 11021021413991. The next prime is 11021021414023. The reversal of 11021021414022 is 22041412012011.
It is a self number, because there is not a number n which added to its sum of digits gives 11021021414022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021021414023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22400449783 + ... + 22400450274.
It is an arithmetic number, because the mean of its divisors is an integer number (1411228351827).
Almost surely, 211021021414022 is an apocalyptic number.
11021021414022 is an abundant number, since it is smaller than the sum of its proper divisors (11558632215210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021021414022 is a wasteful number, since it uses less digits than its factorization.
11021021414022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44800900103.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 11021021414022 its reverse (22041412012011), we get a palindrome (33062433426033).
The spelling of 11021021414022 in words is "eleven trillion, twenty-one billion, twenty-one million, four hundred fourteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •