Base | Representation |
---|---|
bin | 1001011110010001… |
… | …01010000000001101 |
3 | 111010102202122220120 |
4 | 10233020222000031 |
5 | 40403424000040 |
6 | 2200353335153 |
7 | 240013203042 |
oct | 45710520015 |
9 | 14112678816 |
10 | 5085765645 |
11 | 217a867004 |
12 | b9b2674b9 |
13 | 63085a3ac |
14 | 3636291c9 |
15 | 1eb7487d0 |
hex | 12f22a00d |
5085765645 has 32 divisors (see below), whose sum is σ = 8645823360. Its totient is φ = 2552817920.
The previous prime is 5085765631. The next prime is 5085765647. The reversal of 5085765645 is 5465675805.
It is a happy number.
It is not a de Polignac number, because 5085765645 - 29 = 5085765133 is a prime.
It is a super-3 number, since 3×50857656453 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5085765647) 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 31 ways as a sum of consecutive naturals, for example, 39190 + ... + 108200.
It is an arithmetic number, because the mean of its divisors is an integer number (270181980).
Almost surely, 25085765645 is an apocalyptic number.
It is an amenable number.
5085765645 is a deficient number, since it is larger than the sum of its proper divisors (3560057715).
5085765645 is an equidigital number, since it uses as much as digits as its factorization.
5085765645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69070 (or 69036 counting only the distinct ones).
The product of its (nonzero) digits is 5040000, while the sum is 51.
The square root of 5085765645 is about 71314.5542298345. The cubic root of 5085765645 is about 1719.6977165057.
The spelling of 5085765645 in words is "five billion, eighty-five million, seven hundred sixty-five thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •