Base | Representation |
---|---|
bin | 10011101011100010… |
… | …000011001110000111 |
3 | 2000112200112102120010 |
4 | 103223202003032013 |
5 | 321234122103111 |
6 | 13412504041303 |
7 | 1345441166541 |
oct | 235342031607 |
9 | 60480472503 |
10 | 21131441031 |
11 | 8a64169458 |
12 | 4118a63233 |
13 | 1cb9c1647c |
14 | 104668a691 |
15 | 83a262aa6 |
hex | 4eb883387 |
21131441031 has 8 divisors (see below), whose sum is σ = 29832622704. Its totient is φ = 13258943360.
The previous prime is 21131441011. The next prime is 21131441053. The reversal of 21131441031 is 13014413112.
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 21131441031 - 27 = 21131440903 is a prime.
It is a super-2 number, since 2×211314410312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21131440989 and 21131441007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21131441011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207170940 + ... + 207171041.
It is an arithmetic number, because the mean of its divisors is an integer number (3729077838).
Almost surely, 221131441031 is an apocalyptic number.
21131441031 is a deficient number, since it is larger than the sum of its proper divisors (8701181673).
21131441031 is a wasteful number, since it uses less digits than its factorization.
21131441031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414342001.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21131441031 its reverse (13014413112), we get a palindrome (34145854143).
The spelling of 21131441031 in words is "twenty-one billion, one hundred thirty-one million, four hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •