Base | Representation |
---|---|
bin | 1010000001100100100110… |
… | …0111101001000100001001 |
3 | 1110000201000120121120210222 |
4 | 2200121021213221010021 |
5 | 2421041301012210441 |
6 | 35235254221515425 |
7 | 2215215303313310 |
oct | 240311147510411 |
9 | 43021016546728 |
10 | 11022121210121 |
11 | 356a50109354a |
12 | 12a01b2112b75 |
13 | 61c4c64049b8 |
14 | 2a168b469277 |
15 | 141a9d77bd4b |
hex | a06499e9109 |
11022121210121 has 16 divisors (see below), whose sum is σ = 12646594307328. Its totient is φ = 9410146099200.
The previous prime is 11022121210109. The next prime is 11022121210171. The reversal of 11022121210121 is 12101212122011.
It is not a de Polignac number, because 11022121210121 - 26 = 11022121210057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11022121210121.
It is not an unprimeable number, because it can be changed into a prime (11022121210171) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3804041 + ... + 6042761.
It is an arithmetic number, because the mean of its divisors is an integer number (790412144208).
Almost surely, 211022121210121 is an apocalyptic number.
It is an amenable number.
11022121210121 is a deficient number, since it is larger than the sum of its proper divisors (1624473097207).
11022121210121 is a wasteful number, since it uses less digits than its factorization.
11022121210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2241512.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11022121210121 its reverse (12101212122011), we get a palindrome (23123333332132).
The spelling of 11022121210121 in words is "eleven trillion, twenty-two billion, one hundred twenty-one million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •