Base | Representation |
---|---|
bin | 11101101111110111011… |
… | …00111100001011101011 |
3 | 10121201022000010112222121 |
4 | 32313323230330023223 |
5 | 113221310302024321 |
6 | 2101320551332111 |
7 | 133563223410466 |
oct | 16677354741353 |
9 | 3551260115877 |
10 | 1022130111211 |
11 | 36453488a000 |
12 | 146119381037 |
13 | 75504074ac1 |
14 | 376855b62dd |
15 | 1b8c44e6441 |
hex | edfbb3c2eb |
1022130111211 has 48 divisors (see below), whose sum is σ = 1150455729024. Its totient is φ = 907922532000.
The previous prime is 1022130111209. The next prime is 1022130111323. The reversal of 1022130111211 is 1121110312201.
It is a happy number.
It is not a de Polignac number, because 1022130111211 - 21 = 1022130111209 is a prime.
It is a super-2 number, since 2×10221301112112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022130111811) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1126934620 + ... + 1126935526.
It is an arithmetic number, because the mean of its divisors is an integer number (23967827688).
Almost surely, 21022130111211 is an apocalyptic number.
1022130111211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1022130111211 is a deficient number, since it is larger than the sum of its proper divisors (128325617813).
1022130111211 is an frugal number, since it uses more digits than its factorization.
1022130111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1225 (or 1102 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1022130111211 its reverse (1121110312201), we get a palindrome (2143240423412).
The spelling of 1022130111211 in words is "one trillion, twenty-two billion, one hundred thirty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •