Base | Representation |
---|---|
bin | 1001100111001110110001… |
… | …00111000000100000000001 |
3 | 2202211212212222100100211001 |
4 | 10303213120213000200001 |
5 | 10232321004022333222 |
6 | 112543111053252001 |
7 | 4311153202464601 |
oct | 463473047004001 |
9 | 82755788310731 |
10 | 21139168167937 |
11 | 6810086374356 |
12 | 2454ab4794001 |
13 | ba45519c4831 |
14 | 5311d963cc01 |
15 | 269d292a9e27 |
hex | 1339d89c0801 |
21139168167937 has 4 divisors (see below), whose sum is σ = 21139443383296. Its totient is φ = 21138892952580.
The previous prime is 21139168167913. The next prime is 21139168167967. The reversal of 21139168167937 is 73976186193112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21139168167937 - 231 = 21137020684289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21139168167967) 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 3 ways as a sum of consecutive naturals, for example, 137492433 + ... + 137646094.
It is an arithmetic number, because the mean of its divisors is an integer number (5284860845824).
Almost surely, 221139168167937 is an apocalyptic number.
It is an amenable number.
21139168167937 is a deficient number, since it is larger than the sum of its proper divisors (275215359).
21139168167937 is an equidigital number, since it uses as much as digits as its factorization.
21139168167937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275215358.
The product of its digits is 20575296, while the sum is 64.
The spelling of 21139168167937 in words is "twenty-one trillion, one hundred thirty-nine billion, one hundred sixty-eight million, one hundred sixty-seven thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •