Base | Representation |
---|---|
bin | 1001100110010010… |
… | …01100001100000101 |
3 | 111022010022021001010 |
4 | 10303021030030011 |
5 | 41023132431113 |
6 | 2211154552433 |
7 | 241460620662 |
oct | 46311141405 |
9 | 14263267033 |
10 | 5153014533 |
11 | 22048190a7 |
12 | bb9898719 |
13 | 641774934 |
14 | 36c532a69 |
15 | 2025ce1c3 |
hex | 13324c305 |
5153014533 has 8 divisors (see below), whose sum is σ = 6920116000. Its totient is φ = 3410628048.
The previous prime is 5153014513. The next prime is 5153014543. The reversal of 5153014533 is 3354103515.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5153014533 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5153014533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5153014513) 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 7 ways as a sum of consecutive naturals, for example, 6178258 + ... + 6179091.
It is an arithmetic number, because the mean of its divisors is an integer number (865014500).
Almost surely, 25153014533 is an apocalyptic number.
It is an amenable number.
5153014533 is a deficient number, since it is larger than the sum of its proper divisors (1767101467).
5153014533 is a wasteful number, since it uses less digits than its factorization.
5153014533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12357491.
The product of its (nonzero) digits is 13500, while the sum is 30.
The square root of 5153014533 is about 71784.5006460308. The cubic root of 5153014533 is about 1727.2443832689.
The spelling of 5153014533 in words is "five billion, one hundred fifty-three million, fourteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •