Base | Representation |
---|---|
bin | 1100011111001001001011… |
… | …10110001101011100000001 |
3 | 10121012222211101022022010101 |
4 | 12033210211312031130001 |
5 | 12044334210342004022 |
6 | 134222110304202401 |
7 | 5532541531413601 |
oct | 617444566153401 |
9 | 117188741268111 |
10 | 27458360891137 |
11 | 8827030981010 |
12 | 30b5745609401 |
13 | 124240a22aa77 |
14 | 6acdc5554c01 |
15 | 3293c5859627 |
hex | 18f925d8d701 |
27458360891137 has 4 divisors (see below), whose sum is σ = 29954575517616. Its totient is φ = 24962146264660.
The previous prime is 27458360891131. The next prime is 27458360891149. The reversal of 27458360891137 is 73119806385472.
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 de Polignac number, because none of the positive numbers 2k-27458360891137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27458360891131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1248107313223 + ... + 1248107313244.
It is an arithmetic number, because the mean of its divisors is an integer number (7488643879404).
It is a 1-persistent number, because it is pandigital, but 2⋅27458360891137 = 54916721782274 is not.
Almost surely, 227458360891137 is an apocalyptic number.
It is an amenable number.
27458360891137 is a deficient number, since it is larger than the sum of its proper divisors (2496214626479).
27458360891137 is a wasteful number, since it uses less digits than its factorization.
27458360891137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2496214626478.
The product of its (nonzero) digits is 60963840, while the sum is 64.
The spelling of 27458360891137 in words is "twenty-seven trillion, four hundred fifty-eight billion, three hundred sixty million, eight hundred ninety-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •