Base | Representation |
---|---|
bin | 1001011011101111… |
… | …00110000011000101 |
3 | 111001221210001120120 |
4 | 10231313212003011 |
5 | 40333004001111 |
6 | 2154314052153 |
7 | 236334450063 |
oct | 45567460305 |
9 | 14057701516 |
10 | 5064515781 |
11 | 2169872736 |
12 | b9411a059 |
13 | 62932a100 |
14 | 360897033 |
15 | 1e994c406 |
hex | 12dde60c5 |
5064515781 has 24 divisors (see below), whose sum is σ = 7742217600. Its totient is φ = 2933289216.
The previous prime is 5064515767. The next prime is 5064515801. The reversal of 5064515781 is 1875154605.
It is not a de Polignac number, because 5064515781 - 211 = 5064513733 is a prime.
It is a super-2 number, since 2×50645157812 = 51298640191996079922, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5064515741) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 285181 + ... + 302418.
It is an arithmetic number, because the mean of its divisors is an integer number (322592400).
Almost surely, 25064515781 is an apocalyptic number.
5064515781 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5064515781 is a deficient number, since it is larger than the sum of its proper divisors (2677701819).
5064515781 is a wasteful number, since it uses less digits than its factorization.
5064515781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587645 (or 587632 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 42.
The square root of 5064515781 is about 71165.4114089141. The cubic root of 5064515781 is about 1717.2992341533.
The spelling of 5064515781 in words is "five billion, sixty-four million, five hundred fifteen thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •