Base | Representation |
---|---|
bin | 11001001011001100… |
… | …100111110001111001 |
3 | 2120202212100120201211 |
4 | 121023030213301321 |
5 | 420330014404031 |
6 | 20230144443121 |
7 | 1644602065654 |
oct | 311314476171 |
9 | 76685316654 |
10 | 27031403641 |
11 | 10511582710 |
12 | 52a49194a1 |
13 | 271a3576c8 |
14 | 144609889b |
15 | a831d9bb1 |
hex | 64b327c79 |
27031403641 has 4 divisors (see below), whose sum is σ = 29488803984. Its totient is φ = 24574003300.
The previous prime is 27031403621. The next prime is 27031403657. The reversal of 27031403641 is 14630413072.
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 de Polignac number, because none of the positive numbers 2k-27031403641 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27031403621) 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 3 ways as a sum of consecutive naturals, for example, 1228700155 + ... + 1228700176.
It is an arithmetic number, because the mean of its divisors is an integer number (7372200996).
Almost surely, 227031403641 is an apocalyptic number.
It is an amenable number.
27031403641 is a deficient number, since it is larger than the sum of its proper divisors (2457400343).
27031403641 is a wasteful number, since it uses less digits than its factorization.
27031403641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457400342.
The product of its (nonzero) digits is 12096, while the sum is 31.
The spelling of 27031403641 in words is "twenty-seven billion, thirty-one million, four hundred three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •