Base | Representation |
---|---|
bin | 11001100010101111… |
… | …000010101001011001 |
3 | 2121210101102112012110 |
4 | 121202233002221121 |
5 | 422132113140203 |
6 | 20333252502533 |
7 | 1660435503516 |
oct | 314257025131 |
9 | 77711375173 |
10 | 27426302553 |
11 | 106a4484051 |
12 | 539501aa49 |
13 | 27811011c0 |
14 | 14826d230d |
15 | aa7be1d03 |
hex | 662bc2a59 |
27426302553 has 8 divisors (see below), whose sum is σ = 39381357568. Its totient is φ = 16877724624.
The previous prime is 27426302543. The next prime is 27426302581. The reversal of 27426302553 is 35520362472.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 27426302553 - 216 = 27426237017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 703238527 = 27426302553 / (2 + 7 + 4 + 2 + 6 + 3 + 0 + 2 + 5 + 5 + 3).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (27426302543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 351619225 + ... + 351619302.
It is an arithmetic number, because the mean of its divisors is an integer number (4922669696).
Almost surely, 227426302553 is an apocalyptic number.
It is an amenable number.
27426302553 is a deficient number, since it is larger than the sum of its proper divisors (11955055015).
27426302553 is a wasteful number, since it uses less digits than its factorization.
27426302553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703238543.
The product of its (nonzero) digits is 302400, while the sum is 39.
The spelling of 27426302553 in words is "twenty-seven billion, four hundred twenty-six million, three hundred two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •