Base | Representation |
---|---|
bin | 1001011011110010… |
… | …11111000100110011 |
3 | 111001222201020120210 |
4 | 10231321133010303 |
5 | 40333120332012 |
6 | 2154332435203 |
7 | 236341613253 |
oct | 45571370463 |
9 | 14058636523 |
10 | 5065011507 |
11 | 216a081126 |
12 | b94318b03 |
13 | 62947193a |
14 | 360985963 |
15 | 1e99e923c |
hex | 12de5f133 |
5065011507 has 32 divisors (see below), whose sum is σ = 7193272320. Its totient is φ = 3161077920.
The previous prime is 5065011503. The next prime is 5065011557. The reversal of 5065011507 is 7051105605.
5065011507 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5065011507 - 22 = 5065011503 is a prime.
It is a super-2 number, since 2×50650115072 = 51308683132084822098, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5065011503) by changing a digit.
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 in 31 ways as a sum of consecutive naturals, for example, 5348008 + ... + 5348954.
It is an arithmetic number, because the mean of its divisors is an integer number (224789760).
Almost surely, 25065011507 is an apocalyptic number.
5065011507 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
5065011507 is a deficient number, since it is larger than the sum of its proper divisors (2128260813).
5065011507 is a wasteful number, since it uses less digits than its factorization.
5065011507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1983.
The product of its (nonzero) digits is 5250, while the sum is 30.
The square root of 5065011507 is about 71168.8942375811. The cubic root of 5065011507 is about 1717.3552633403.
The spelling of 5065011507 in words is "five billion, sixty-five million, eleven thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •