Base | Representation |
---|---|
bin | 1100010110100010000010… |
… | …10000111001111110011111 |
3 | 10120011201002002212122212210 |
4 | 12023101001100321332133 |
5 | 12030012213320140334 |
6 | 133434133211331503 |
7 | 5502265165431525 |
oct | 613210120717637 |
9 | 116151062778783 |
10 | 27162468130719 |
11 | 87225a1154699 |
12 | 3068327750b93 |
13 | 12205432ca64c |
14 | 69c955ac0315 |
15 | 321858a555e9 |
hex | 18b441439f9f |
27162468130719 has 8 divisors (see below), whose sum is σ = 36216674144560. Its totient is φ = 18108287102016.
The previous prime is 27162468130717. The next prime is 27162468130757. The reversal of 27162468130719 is 91703186426172.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 27162468130719 - 21 = 27162468130717 is a prime.
It is a super-2 number, since 2×271624681307192 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27162468130717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3542404 + ... + 8177625.
It is an arithmetic number, because the mean of its divisors is an integer number (4527084268070).
Almost surely, 227162468130719 is an apocalyptic number.
27162468130719 is a deficient number, since it is larger than the sum of its proper divisors (9054206013841).
27162468130719 is a wasteful number, since it uses less digits than its factorization.
27162468130719 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12492569.
The product of its (nonzero) digits is 6096384, while the sum is 57.
The spelling of 27162468130719 in words is "twenty-seven trillion, one hundred sixty-two billion, four hundred sixty-eight million, one hundred thirty thousand, seven hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •