Base | Representation |
---|---|
bin | 1010000001100100101000… |
… | …1001101000101001110011 |
3 | 1110000201001012101022200210 |
4 | 2200121022021220221303 |
5 | 2421041310302340311 |
6 | 35235255140515203 |
7 | 2215215442126440 |
oct | 240311211505163 |
9 | 43021035338623 |
10 | 11022130121331 |
11 | 356a50611a68a |
12 | 12a01b50abb03 |
13 | 61c4c8204ac4 |
14 | 2a168c7089c7 |
15 | 141a9e43c3a6 |
hex | a064a268a73 |
11022130121331 has 32 divisors (see below), whose sum is σ = 17700679987200. Its totient is φ = 5959755372960.
The previous prime is 11022130121207. The next prime is 11022130121377. The reversal of 11022130121331 is 13312103122011.
It is not a de Polignac number, because 11022130121331 - 27 = 11022130121203 is a prime.
It is a super-2 number, since 2×110221301213312 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 11022130121298 and 11022130121307.
It is not an unprimeable number, because it can be changed into a prime (11022130121381) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16127925 + ... + 16797446.
It is an arithmetic number, because the mean of its divisors is an integer number (553146249600).
Almost surely, 211022130121331 is an apocalyptic number.
11022130121331 is a deficient number, since it is larger than the sum of its proper divisors (6678549865869).
11022130121331 is a wasteful number, since it uses less digits than its factorization.
11022130121331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32926239.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11022130121331 its reverse (13312103122011), we get a palindrome (24334233243342).
The spelling of 11022130121331 in words is "eleven trillion, twenty-two billion, one hundred thirty million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •