Base | Representation |
---|---|
bin | 10011110110010000… |
… | …010100001001000001 |
3 | 2001000020001022002102 |
4 | 103312100110021001 |
5 | 322121200403441 |
6 | 13442412000145 |
7 | 1353054260600 |
oct | 236620241101 |
9 | 61006038072 |
10 | 21311341121 |
11 | 9046773014 |
12 | 4169160055 |
13 | 2018283a25 |
14 | 1062519a37 |
15 | 84ae4b69b |
hex | 4f6414241 |
21311341121 has 12 divisors (see below), whose sum is σ = 24796884420. Its totient is φ = 18262339200.
The previous prime is 21311341061. The next prime is 21311341123. The reversal of 21311341121 is 12114311312.
It can be written as a sum of positive squares in 2 ways, for example, as 969450496 + 20341890625 = 31136^2 + 142625^2 .
It is a de Polignac number, because none of the positive numbers 2k-21311341121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21311341093 and 21311341102.
It is not an unprimeable number, because it can be changed into a prime (21311341123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 154085 + ... + 257613.
It is an arithmetic number, because the mean of its divisors is an integer number (2066407035).
Almost surely, 221311341121 is an apocalyptic number.
It is an amenable number.
21311341121 is a deficient number, since it is larger than the sum of its proper divisors (3485543299).
21311341121 is a wasteful number, since it uses less digits than its factorization.
21311341121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107744 (or 107737 counting only the distinct ones).
The product of its digits is 144, while the sum is 20.
Adding to 21311341121 its reverse (12114311312), we get a palindrome (33425652433).
The spelling of 21311341121 in words is "twenty-one billion, three hundred eleven million, three hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.758 sec. • engine limits •