Base | Representation |
---|---|
bin | 11001101100101011… |
… | …101110010011100001 |
3 | 2122020000111001021010 |
4 | 121230223232103201 |
5 | 423002330024321 |
6 | 20402014051133 |
7 | 1664533241460 |
oct | 315453562341 |
9 | 78200431233 |
10 | 27593204961 |
11 | 1077a710323 |
12 | 5420aa9aa9 |
13 | 27a986a61a |
14 | 149a93a9d7 |
15 | ab76ae676 |
hex | 66caee4e1 |
27593204961 has 16 divisors (see below), whose sum is σ = 42112200704. Its totient is φ = 15743016144.
The previous prime is 27593204897. The next prime is 27593205001. The reversal of 27593204961 is 16940239572.
It is not a de Polignac number, because 27593204961 - 26 = 27593204897 is a prime.
It is a super-2 number, since 2×275932049612 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 27593204961.
It is not an unprimeable number, because it can be changed into a prime (27593204161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1008241 + ... + 1035246.
It is an arithmetic number, because the mean of its divisors is an integer number (2632012544).
Almost surely, 227593204961 is an apocalyptic number.
27593204961 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
27593204961 is a deficient number, since it is larger than the sum of its proper divisors (14518995743).
27593204961 is a wasteful number, since it uses less digits than its factorization.
27593204961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2044140.
The product of its (nonzero) digits is 816480, while the sum is 48.
The spelling of 27593204961 in words is "twenty-seven billion, five hundred ninety-three million, two hundred four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •