Base | Representation |
---|---|
bin | 1001111011101000… |
… | …00001010011110101 |
3 | 111202121010101121001 |
4 | 10331310001103311 |
5 | 41404443424300 |
6 | 2241031323301 |
7 | 246063242161 |
oct | 47564012365 |
9 | 14677111531 |
10 | 5332014325 |
11 | 2296868310 |
12 | 1049820531 |
13 | 66c888481 |
14 | 388209ca1 |
15 | 21318b16a |
hex | 13dd014f5 |
5332014325 has 24 divisors (see below), whose sum is σ = 7222796640. Its totient is φ = 3872433600.
The previous prime is 5332014323. The next prime is 5332014329. The reversal of 5332014325 is 5234102335.
It is not a de Polignac number, because 5332014325 - 21 = 5332014323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5332014293 and 5332014302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5332014323) 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, 190107 + ... + 216343.
It is an arithmetic number, because the mean of its divisors is an integer number (300949860).
Almost surely, 25332014325 is an apocalyptic number.
5332014325 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5332014325 is a deficient number, since it is larger than the sum of its proper divisors (1890782315).
5332014325 is a wasteful number, since it uses less digits than its factorization.
5332014325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26997 (or 26992 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 5332014325 is about 73020.6431428812. The cubic root of 5332014325 is about 1747.0168851081.
The spelling of 5332014325 in words is "five billion, three hundred thirty-two million, fourteen thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •