Base | Representation |
---|---|
bin | 10011110101110001… |
… | …110000100100111011 |
3 | 2000222122222100110010 |
4 | 103311301300210323 |
5 | 322112123044011 |
6 | 13441524153003 |
7 | 1352626220055 |
oct | 236561604473 |
9 | 60878870403 |
10 | 21303331131 |
11 | 90421a1a95 |
12 | 4166538763 |
13 | 201670aba4 |
14 | 10614328d5 |
15 | 84a3b81a6 |
hex | 4f5c7093b |
21303331131 has 8 divisors (see below), whose sum is σ = 28885872960. Its totient is φ = 13961505032.
The previous prime is 21303331121. The next prime is 21303331139. The reversal of 21303331131 is 13113330312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21303331131 - 221 = 21301233979 is a prime.
It is a super-2 number, since 2×213033311312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21303331098 and 21303331107.
It is not an unprimeable number, because it can be changed into a prime (21303331139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60178725 + ... + 60179078.
It is an arithmetic number, because the mean of its divisors is an integer number (3610734120).
Almost surely, 221303331131 is an apocalyptic number.
21303331131 is a deficient number, since it is larger than the sum of its proper divisors (7582541829).
21303331131 is a wasteful number, since it uses less digits than its factorization.
21303331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120357865.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 21303331131 its reverse (13113330312), we get a palindrome (34416661443).
The spelling of 21303331131 in words is "twenty-one billion, three hundred three million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •