Base | Representation |
---|---|
bin | 1100010110100000100111… |
… | …11001111111101010110000 |
3 | 10120011122010001221211120201 |
4 | 12023100103321333222300 |
5 | 12030004134012300000 |
6 | 133433525505044544 |
7 | 5502240265260043 |
oct | 613202371775260 |
9 | 116148101854521 |
10 | 27161707150000 |
11 | 8722240644605 |
12 | 3068154926754 |
13 | 1220451759ab7 |
14 | 69c8c29d0c5a |
15 | 321811d3996a |
hex | 18b413e7fab0 |
27161707150000 has 60 divisors (see below), whose sum is σ = 65778049560384. Its totient is φ = 10864682840000.
The previous prime is 27161707149961. The next prime is 27161707150007. The reversal of 27161707150000 is 5170716172.
It is a super-4 number, since 4×271617071500004 (a number of 55 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (27161707150007) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 271567072 + ... + 271667071.
Almost surely, 227161707150000 is an apocalyptic number.
27161707150000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27161707150000 is an abundant number, since it is smaller than the sum of its proper divisors (38616342410384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27161707150000 is an frugal number, since it uses more digits than its factorization.
27161707150000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 543234176 (or 543234150 counting only the distinct ones).
The product of its (nonzero) digits is 20580, while the sum is 37.
Adding to 27161707150000 its reverse (5170716172), we get a palindrome (27166877866172).
The spelling of 27161707150000 in words is "twenty-seven trillion, one hundred sixty-one billion, seven hundred seven million, one hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •