Base | Representation |
---|---|
bin | 10011101100000100… |
… | …011000010001000011 |
3 | 2000120022110122000010 |
4 | 103230010120101003 |
5 | 321243423041011 |
6 | 13413425000003 |
7 | 1345610530146 |
oct | 235404302103 |
9 | 60508418003 |
10 | 21140440131 |
11 | 8a69255628 |
12 | 411ba83003 |
13 | 1cbba47595 |
14 | 104795005d |
15 | 83ae3e1a6 |
hex | 4ec118443 |
21140440131 has 8 divisors (see below), whose sum is σ = 28874747664. Its totient is φ = 13749879680.
The previous prime is 21140440127. The next prime is 21140440169. The reversal of 21140440131 is 13104404112.
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 21140440131 - 22 = 21140440127 is a prime.
It is a super-2 number, since 2×211404401312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21140440098 and 21140440107.
It is not an unprimeable number, because it can be changed into a prime (21140440121) 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 7 ways as a sum of consecutive naturals, for example, 85936626 + ... + 85936871.
It is an arithmetic number, because the mean of its divisors is an integer number (3609343458).
Almost surely, 221140440131 is an apocalyptic number.
21140440131 is a deficient number, since it is larger than the sum of its proper divisors (7734307533).
21140440131 is a wasteful number, since it uses less digits than its factorization.
21140440131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171873541.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 21140440131 its reverse (13104404112), we get a palindrome (34244844243).
The spelling of 21140440131 in words is "twenty-one billion, one hundred forty million, four hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •