Base | Representation |
---|---|
bin | 10100010100011100100111 |
3 | 101000121202122 |
4 | 110110130213 |
5 | 2330423011 |
6 | 310100155 |
7 | 63163352 |
oct | 24243447 |
9 | 11017678 |
10 | 5326631 |
11 | 3008a82 |
12 | 194a65b |
13 | 114666b |
14 | 9c9299 |
15 | 7033db |
hex | 514727 |
5326631 has 8 divisors (see below), whose sum is σ = 5759280. Its totient is φ = 4909248.
The previous prime is 5326609. The next prime is 5326667. The reversal of 5326631 is 1366235.
5326631 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 5326631 - 214 = 5310247 is a prime.
It is a super-2 number, since 2×53266312 = 56745995620322, which contains 22 as substring.
It is a plaindrome in base 13.
It is a self number, because there is not a number n which added to its sum of digits gives 5326631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5326681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3086 + ... + 4491.
It is an arithmetic number, because the mean of its divisors is an integer number (719910).
Almost surely, 25326631 is an apocalyptic number.
5326631 is a deficient number, since it is larger than the sum of its proper divisors (432649).
5326631 is a wasteful number, since it uses less digits than its factorization.
5326631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7633.
The product of its digits is 3240, while the sum is 26.
The square root of 5326631 is about 2307.9495228449. The cubic root of 5326631 is about 174.6428744244.
The spelling of 5326631 in words is "five million, three hundred twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •