Base | Representation |
---|---|
bin | 10100001011010110… |
… | …100100001010001101 |
3 | 2001220220002022221111 |
4 | 110023112210022031 |
5 | 323332304114013 |
6 | 13541454332021 |
7 | 1364613010150 |
oct | 241326441215 |
9 | 61826068844 |
10 | 21665301133 |
11 | 9208552453 |
12 | 42477ba011 |
13 | 20736c5518 |
14 | 1097537c97 |
15 | 86c06873d |
hex | 50b5a428d |
21665301133 has 8 divisors (see below), whose sum is σ = 26063520320. Its totient is φ = 17592876000.
The previous prime is 21665301127. The next prime is 21665301137. The reversal of 21665301133 is 33110356612.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21665301133 - 221 = 21663203981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21665301095 and 21665301104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21665301137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81448368 + ... + 81448633.
It is an arithmetic number, because the mean of its divisors is an integer number (3257940040).
Almost surely, 221665301133 is an apocalyptic number.
It is an amenable number.
21665301133 is a deficient number, since it is larger than the sum of its proper divisors (4398219187).
21665301133 is a wasteful number, since it uses less digits than its factorization.
21665301133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162897027.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 21665301133 its reverse (33110356612), we get a palindrome (54775657745).
It can be divided in two parts, 2166530113 and 3, that added together give a square (2166530116 = 465462).
The spelling of 21665301133 in words is "twenty-one billion, six hundred sixty-five million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •