Base | Representation |
---|---|
bin | 1001111010111000… |
… | …00111000100000101 |
3 | 111202011022221200001 |
4 | 10331130013010011 |
5 | 41401342341222 |
6 | 2240245121301 |
7 | 245656045354 |
oct | 47534070405 |
9 | 14664287601 |
10 | 5325746437 |
11 | 2293277140 |
12 | 10476b9231 |
13 | 66b4a256b |
14 | 38745799b |
15 | 21284de27 |
hex | 13d707105 |
5325746437 has 8 divisors (see below), whose sum is σ = 5829737760. Its totient is φ = 4825060560.
The previous prime is 5325746407. The next prime is 5325746449. The reversal of 5325746437 is 7346475235.
5325746437 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5325746437 - 227 = 5191528709 is a prime.
It is a super-2 number, since 2×53257464372 = 56727150222436389938, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5325746407) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 822987 + ... + 829432.
It is an arithmetic number, because the mean of its divisors is an integer number (728717220).
Almost surely, 25325746437 is an apocalyptic number.
It is an amenable number.
5325746437 is a deficient number, since it is larger than the sum of its proper divisors (503991323).
5325746437 is a wasteful number, since it uses less digits than its factorization.
5325746437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1652723.
The product of its digits is 2116800, while the sum is 46.
The square root of 5325746437 is about 72977.7119194621. The cubic root of 5325746437 is about 1746.3320657637.
The spelling of 5325746437 in words is "five billion, three hundred twenty-five million, seven hundred forty-six thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •