Base | Representation |
---|---|
bin | 110100001100… |
… | …1111001010010 |
3 | 1220111111021020 |
4 | 1220121321102 |
5 | 24001302132 |
6 | 2414340310 |
7 | 451430061 |
oct | 150317122 |
9 | 56444236 |
10 | 27369042 |
11 | 144a3848 |
12 | 91ba696 |
13 | 58935cc |
14 | 38c61d8 |
15 | 260952c |
hex | 1a19e52 |
27369042 has 8 divisors (see below), whose sum is σ = 54738096. Its totient is φ = 9123012.
The previous prime is 27369037. The next prime is 27369047. The reversal of 27369042 is 24096372.
It is an interprime number because it is at equal distance from previous prime (27369037) and next prime (27369047).
It is a sphenic number, since it is the product of 3 distinct primes.
27369042 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 27368994 and 27369012.
It is not an unprimeable number, because it can be changed into a prime (27369047) 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, 2280748 + ... + 2280759.
It is an arithmetic number, because the mean of its divisors is an integer number (6842262).
Almost surely, 227369042 is an apocalyptic number.
27369042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27369042 is a wasteful number, since it uses less digits than its factorization.
27369042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4561512.
The product of its (nonzero) digits is 18144, while the sum is 33.
The square root of 27369042 is about 5231.5429846270. The cubic root of 27369042 is about 301.3606417394.
The spelling of 27369042 in words is "twenty-seven million, three hundred sixty-nine thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •