Base | Representation |
---|---|
bin | 1100011011100001110110… |
… | …01101100000111001100011 |
3 | 10120210010020222100001120202 |
4 | 12031300323031200321203 |
5 | 12040320332302120430 |
6 | 134045050413055415 |
7 | 5520554045146124 |
oct | 615607315407143 |
9 | 116703228301522 |
10 | 27334165270115 |
11 | 8789399770800 |
12 | 309566478756b |
13 | 12337a6a3bc12 |
14 | 6a6da2cd604b |
15 | 32605738bd45 |
hex | 18dc3b360e63 |
27334165270115 has 12 divisors (see below), whose sum is σ = 36053989894272. Its totient is φ = 19879392923280.
The previous prime is 27334165270109. The next prime is 27334165270127. The reversal of 27334165270115 is 51107256143372.
It is not a de Polignac number, because 27334165270115 - 212 = 27334165266019 is a prime.
It is a super-2 number, since 2×273341652701152 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 27334165270115.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 22590218627 + ... + 22590219836.
It is an arithmetic number, because the mean of its divisors is an integer number (3004499157856).
Almost surely, 227334165270115 is an apocalyptic number.
27334165270115 is a deficient number, since it is larger than the sum of its proper divisors (8719824624157).
27334165270115 is a wasteful number, since it uses less digits than its factorization.
27334165270115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45180438490 (or 45180438479 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 27334165270115 in words is "twenty-seven trillion, three hundred thirty-four billion, one hundred sixty-five million, two hundred seventy thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •