Base | Representation |
---|---|
bin | 1001011011110010… |
… | …00100110010010111 |
3 | 111001222111202212210 |
4 | 10231321010302113 |
5 | 40333103410311 |
6 | 2154330244503 |
7 | 236340654321 |
oct | 45571046227 |
9 | 14058452783 |
10 | 5064903831 |
11 | 216a008239 |
12 | b94286733 |
13 | 629434920 |
14 | 360958611 |
15 | 1e99c73a6 |
hex | 12de44c97 |
5064903831 has 16 divisors (see below), whose sum is σ = 7274723456. Its totient is φ = 3115989216.
The previous prime is 5064903797. The next prime is 5064903887. The reversal of 5064903831 is 1383094605.
It is not a de Polignac number, because 5064903831 - 27 = 5064903703 is a prime.
It is a super-2 number, since 2×50649038312 = 51306501634556953122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 5064903831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5064903031) 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 15 ways as a sum of consecutive naturals, for example, 139896 + ... + 172338.
It is an arithmetic number, because the mean of its divisors is an integer number (454670216).
Almost surely, 25064903831 is an apocalyptic number.
5064903831 is a deficient number, since it is larger than the sum of its proper divisors (2209819625).
5064903831 is a wasteful number, since it uses less digits than its factorization.
5064903831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36462.
The product of its (nonzero) digits is 77760, while the sum is 39.
The square root of 5064903831 is about 71168.1377513842. The cubic root of 5064903831 is about 1717.3430936242.
The spelling of 5064903831 in words is "five billion, sixty-four million, nine hundred three thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •