Base | Representation |
---|---|
bin | 1001100101111100… |
… | …00101010011001101 |
3 | 111021220211022210200 |
4 | 10302332011103031 |
5 | 41021411241413 |
6 | 2211012324113 |
7 | 241424102526 |
oct | 46276052315 |
9 | 14256738720 |
10 | 5150102733 |
11 | 220310a456 |
12 | bb8913639 |
13 | 640c95489 |
14 | 36bdb584d |
15 | 202206573 |
hex | 132f854cd |
5150102733 has 24 divisors (see below), whose sum is σ = 7644024960. Its totient is φ = 3339463680.
The previous prime is 5150102731. The next prime is 5150102759. The reversal of 5150102733 is 3372010515.
It is not a de Polignac number, because 5150102733 - 21 = 5150102731 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5150102697 and 5150102706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5150102731) 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, 64653 + ... + 120333.
It is an arithmetic number, because the mean of its divisors is an integer number (318501040).
Almost surely, 25150102733 is an apocalyptic number.
It is an amenable number.
5150102733 is a deficient number, since it is larger than the sum of its proper divisors (2493922227).
5150102733 is a wasteful number, since it uses less digits than its factorization.
5150102733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55969 (or 55966 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 5150102733 is about 71764.2162431946. The cubic root of 5150102733 is about 1726.9189855316.
The spelling of 5150102733 in words is "five billion, one hundred fifty million, one hundred two thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •