Base | Representation |
---|---|
bin | 1100101000100000010101… |
… | …01100110111000011111001 |
3 | 10122100202002220201122001111 |
4 | 12110100022230313003321 |
5 | 12120121444132040203 |
6 | 135025545122520321 |
7 | 5565016663636261 |
oct | 624201254670371 |
9 | 118322086648044 |
10 | 27780028002553 |
11 | 8940497646862 |
12 | 3147b572060a1 |
13 | 1266850c36b58 |
14 | 6c07bc1427a1 |
15 | 3329502dd26d |
hex | 19440ab370f9 |
27780028002553 has 4 divisors (see below), whose sum is σ = 27787481729920. Its totient is φ = 27772574275188.
The previous prime is 27780028002547. The next prime is 27780028002599. The reversal of 27780028002553 is 35520082008772.
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 27780028002553 - 225 = 27779994448121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27780028002497 and 27780028002506.
It is not an unprimeable number, because it can be changed into a prime (27780028002533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3726858093 + ... + 3726865546.
It is an arithmetic number, because the mean of its divisors is an integer number (6946870432480).
Almost surely, 227780028002553 is an apocalyptic number.
It is an amenable number.
27780028002553 is a deficient number, since it is larger than the sum of its proper divisors (7453727367).
27780028002553 is an equidigital number, since it uses as much as digits as its factorization.
27780028002553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7453727366.
The product of its (nonzero) digits is 1881600, while the sum is 49.
The spelling of 27780028002553 in words is "twenty-seven trillion, seven hundred eighty billion, twenty-eight million, two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •