Base | Representation |
---|---|
bin | 1001011010110001… |
… | …10111110110011001 |
3 | 111001101121220012000 |
4 | 10231120313312121 |
5 | 40323423242413 |
6 | 2153425311213 |
7 | 236206135254 |
oct | 45530676631 |
9 | 14041556160 |
10 | 5056462233 |
11 | 2165271a09 |
12 | b91495509 |
13 | 62776a4b4 |
14 | 35d79c09b |
15 | 1e8dab073 |
hex | 12d637d99 |
5056462233 has 16 divisors (see below), whose sum is σ = 7493006400. Its totient is φ = 3370096800.
The previous prime is 5056462219. The next prime is 5056462247. The reversal of 5056462233 is 3322646505.
5056462233 is a `hidden beast` number, since 5 + 0 + 5 + 646 + 2 + 2 + 3 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (5056462219) and next prime (5056462247).
It is not a de Polignac number, because 5056462233 - 210 = 5056461209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5056462253) 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 15 ways as a sum of consecutive naturals, for example, 91138 + ... + 135716.
It is an arithmetic number, because the mean of its divisors is an integer number (468312900).
Almost surely, 25056462233 is an apocalyptic number.
It is an amenable number.
5056462233 is a deficient number, since it is larger than the sum of its proper divisors (2436544167).
5056462233 is a wasteful number, since it uses less digits than its factorization.
5056462233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48789 (or 48783 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
The square root of 5056462233 is about 71108.8055939628. The cubic root of 5056462233 is about 1716.3884732262.
The spelling of 5056462233 in words is "five billion, fifty-six million, four hundred sixty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •