Base | Representation |
---|---|
bin | 1100011110011101111000… |
… | …00111101101000001001001 |
3 | 10121010202211010220020122111 |
4 | 12033032330013231001021 |
5 | 12043444102214134221 |
6 | 134203303325222321 |
7 | 5531056441314133 |
oct | 617167407550111 |
9 | 117122733806574 |
10 | 27435112255561 |
11 | 88181906aaaaa |
12 | 30b11377019a1 |
13 | 12401737b627a |
14 | 6abc1ba24053 |
15 | 3289b47d4be1 |
hex | 18f3bc1ed049 |
27435112255561 has 4 divisors (see below), whose sum is σ = 27435134202112. Its totient is φ = 27435090309012.
The previous prime is 27435112255541. The next prime is 27435112255567. The reversal of 27435112255561 is 16555221153472.
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 cyclic number.
It is not a de Polignac number, because 27435112255561 - 213 = 27435112247369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27435112255567) 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 3 ways as a sum of consecutive naturals, for example, 8977101 + ... + 11638666.
It is an arithmetic number, because the mean of its divisors is an integer number (6858783550528).
Almost surely, 227435112255561 is an apocalyptic number.
It is an amenable number.
27435112255561 is a deficient number, since it is larger than the sum of its proper divisors (21946551).
27435112255561 is a wasteful number, since it uses less digits than its factorization.
27435112255561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21946550.
The product of its digits is 2520000, while the sum is 49.
The spelling of 27435112255561 in words is "twenty-seven trillion, four hundred thirty-five billion, one hundred twelve million, two hundred fifty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •