Base | Representation |
---|---|
bin | 1010010010110010… |
… | …01011110110110111 |
3 | 112021010201102222120 |
4 | 11021121023312313 |
5 | 42304213244411 |
6 | 2312211531023 |
7 | 253642553655 |
oct | 51131136667 |
9 | 15233642876 |
10 | 5526306231 |
11 | 2386501736 |
12 | 10a28b9a73 |
13 | 6a0bc45b4 |
14 | 3a5d43dd5 |
15 | 225269106 |
hex | 14964bdb7 |
5526306231 has 8 divisors (see below), whose sum is σ = 7372337280. Its totient is φ = 3682239672.
The previous prime is 5526306193. The next prime is 5526306239. The reversal of 5526306231 is 1326036255.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5526306231 - 213 = 5526298039 is a prime.
It is a super-2 number, since 2×55263062312 = 61080121117578850722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5526306192 and 5526306201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5526306239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 484545 + ... + 495818.
It is an arithmetic number, because the mean of its divisors is an integer number (921542160).
Almost surely, 25526306231 is an apocalyptic number.
5526306231 is a deficient number, since it is larger than the sum of its proper divisors (1846031049).
5526306231 is a wasteful number, since it uses less digits than its factorization.
5526306231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982245.
The product of its (nonzero) digits is 32400, while the sum is 33.
The square root of 5526306231 is about 74339.1298778779. The cubic root of 5526306231 is about 1767.9839399821.
The spelling of 5526306231 in words is "five billion, five hundred twenty-six million, three hundred six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •