Base | Representation |
---|---|
bin | 100001011111111… |
… | …101111001100110 |
3 | 1110011112222122211 |
4 | 201133331321212 |
5 | 2122334400014 |
6 | 131434114034 |
7 | 16633105663 |
oct | 4137757146 |
9 | 1404488584 |
10 | 562028134 |
11 | 269283068 |
12 | 13827b91a |
13 | 8c592235 |
14 | 54900a6a |
15 | 3451bcc4 |
hex | 217fde66 |
562028134 has 4 divisors (see below), whose sum is σ = 843042204. Its totient is φ = 281014066.
The previous prime is 562028111. The next prime is 562028183. The reversal of 562028134 is 431820265.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 431820265 = 5 ⋅86364053.
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 junction number, because it is equal to n+sod(n) for n = 562028096 and 562028105.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 140507032 + ... + 140507035.
It is an arithmetic number, because the mean of its divisors is an integer number (210760551).
Almost surely, 2562028134 is an apocalyptic number.
562028134 is a deficient number, since it is larger than the sum of its proper divisors (281014070).
562028134 is a wasteful number, since it uses less digits than its factorization.
562028134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281014069.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 562028134 is about 23707.1325554146. The cubic root of 562028134 is about 825.2509228785.
Adding to 562028134 its reverse (431820265), we get a palindrome (993848399).
The spelling of 562028134 in words is "five hundred sixty-two million, twenty-eight thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •