Base | Representation |
---|---|
bin | 1001111011101010… |
… | …01100000000111011 |
3 | 111202121200221100000 |
4 | 10331311030000323 |
5 | 41410033222230 |
6 | 2241042044043 |
7 | 246065655240 |
oct | 47565140073 |
9 | 14677627300 |
10 | 5332320315 |
11 | 2296a571a3 |
12 | 1049949623 |
13 | 66c96482a |
14 | 3882895c7 |
15 | 2131ebb60 |
hex | 13dd4c03b |
5332320315 has 48 divisors (see below), whose sum is σ = 10954315008. Its totient is φ = 2437628256.
The previous prime is 5332320269. The next prime is 5332320319. The reversal of 5332320315 is 5130232335.
5332320315 is a `hidden beast` number, since 5 + 3 + 323 + 20 + 315 = 666.
It is not a de Polignac number, because 5332320315 - 29 = 5332319803 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5332320319) 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 47 ways as a sum of consecutive naturals, for example, 304977 + ... + 321986.
It is an arithmetic number, because the mean of its divisors is an integer number (228214896).
Almost surely, 25332320315 is an apocalyptic number.
5332320315 is an abundant number, since it is smaller than the sum of its proper divisors (5621994693).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5332320315 is an equidigital number, since it uses as much as digits as its factorization.
5332320315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626990 (or 626978 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 27.
The square root of 5332320315 is about 73022.7383422452. The cubic root of 5332320315 is about 1747.0503033399.
The spelling of 5332320315 in words is "five billion, three hundred thirty-two million, three hundred twenty thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •