Base | Representation |
---|---|
bin | 100001101011100… |
… | …000101010001101 |
3 | 1110101020201111101 |
4 | 201223200222031 |
5 | 2124123212333 |
6 | 132023023101 |
7 | 20000611012 |
oct | 4153405215 |
9 | 1411221441 |
10 | 565054093 |
11 | 26aa5a55a |
12 | 13929aa91 |
13 | 900b1646 |
14 | 5508b709 |
15 | 3491867d |
hex | 21ae0a8d |
565054093 has 4 divisors (see below), whose sum is σ = 566205408. Its totient is φ = 563902780.
The previous prime is 565054037. The next prime is 565054111. The reversal of 565054093 is 390450565.
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 a de Polignac number, because none of the positive numbers 2k-565054093 is a prime.
It is a super-2 number, since 2×5650540932 = 638572256032105298, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (565054393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 574921 + ... + 575902.
It is an arithmetic number, because the mean of its divisors is an integer number (141551352).
Almost surely, 2565054093 is an apocalyptic number.
It is an amenable number.
565054093 is a deficient number, since it is larger than the sum of its proper divisors (1151315).
565054093 is a wasteful number, since it uses less digits than its factorization.
565054093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1151314.
The product of its (nonzero) digits is 81000, while the sum is 37.
The square root of 565054093 is about 23770.8664755831. The cubic root of 565054093 is about 826.7293229008.
The spelling of 565054093 in words is "five hundred sixty-five million, fifty-four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •