Base | Representation |
---|---|
bin | 1001110010011001… |
… | …11001101011000101 |
3 | 111120012112220110121 |
4 | 10321030321223011 |
5 | 41230142304230 |
6 | 2225225221541 |
7 | 244133535643 |
oct | 47114715305 |
9 | 14505486417 |
10 | 5254650565 |
11 | 225712781a |
12 | 10279318b1 |
13 | 65983bcb8 |
14 | 37bc2c193 |
15 | 20b4a877a |
hex | 139339ac5 |
5254650565 has 8 divisors (see below), whose sum is σ = 6306096888. Its totient is φ = 4203376320.
The previous prime is 5254650553. The next prime is 5254650671. The reversal of 5254650565 is 5650564525.
It can be written as a sum of positive squares in 4 ways, for example, as 3802202244 + 1452448321 = 61662^2 + 38111^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5254650565 - 217 = 5254519493 is a prime.
It is a super-2 number, since 2×52546505652 = 55222705120509638450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38059 + ... + 109351.
It is an arithmetic number, because the mean of its divisors is an integer number (788262111).
Almost surely, 25254650565 is an apocalyptic number.
It is an amenable number.
5254650565 is a deficient number, since it is larger than the sum of its proper divisors (1051446323).
5254650565 is a wasteful number, since it uses less digits than its factorization.
5254650565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86039.
The product of its (nonzero) digits is 900000, while the sum is 43.
The square root of 5254650565 is about 72488.9685745355. The cubic root of 5254650565 is about 1738.5263610767.
The spelling of 5254650565 in words is "five billion, two hundred fifty-four million, six hundred fifty thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •