Base | Representation |
---|---|
bin | 10011111101001010… |
… | …000000010110111001 |
3 | 2001022021220212110121 |
4 | 103331022000112321 |
5 | 322340321041422 |
6 | 13502105413241 |
7 | 1355661403111 |
oct | 237512002671 |
9 | 61267825417 |
10 | 21427127737 |
11 | 90a6067234 |
12 | 419ba9a221 |
13 | 2036263c12 |
14 | 1073a5a041 |
15 | 8561bd8c7 |
hex | 4fd2805b9 |
21427127737 has 8 divisors (see below), whose sum is σ = 21836734920. Its totient is φ = 21017717760.
The previous prime is 21427127713. The next prime is 21427127747. The reversal of 21427127737 is 73772172412.
It can be written as a sum of positive squares in 4 ways, for example, as 16817939856 + 4609187881 = 129684^2 + 67891^2 .
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 21427127737 - 211 = 21427125689 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21427127693 and 21427127702.
It is not an unprimeable number, because it can be changed into a prime (21427127747) 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, 180187 + ... + 274447.
It is an arithmetic number, because the mean of its divisors is an integer number (2729591865).
Almost surely, 221427127737 is an apocalyptic number.
It is an amenable number.
21427127737 is a deficient number, since it is larger than the sum of its proper divisors (409607183).
21427127737 is an equidigital number, since it uses as much as digits as its factorization.
21427127737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98603.
The product of its digits is 230496, while the sum is 43.
The spelling of 21427127737 in words is "twenty-one billion, four hundred twenty-seven million, one hundred twenty-seven thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •