Base | Representation |
---|---|
bin | 1010101000011000… |
… | …11001101100101111 |
3 | 112201202200021012000 |
4 | 11110030121230233 |
5 | 43142110120211 |
6 | 2342203343343 |
7 | 261302662416 |
oct | 52414315457 |
9 | 15652607160 |
10 | 5707504431 |
11 | 2469812612 |
12 | 1133521b53 |
13 | 6cc5c7975 |
14 | 3c203047d |
15 | 23610c656 |
hex | 154319b2f |
5707504431 has 16 divisors (see below), whose sum is σ = 8490657120. Its totient is φ = 3789210240.
The previous prime is 5707504427. The next prime is 5707504433. The reversal of 5707504431 is 1344057075.
It is a happy number.
5707504431 is a `hidden beast` number, since 570 + 7 + 50 + 4 + 4 + 31 = 666.
It is not a de Polignac number, because 5707504431 - 22 = 5707504427 is a prime.
It is a super-2 number, since 2×57075044312 = 65151213659769267522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5707504433) 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 15 ways as a sum of consecutive naturals, for example, 432060 + ... + 445073.
It is an arithmetic number, because the mean of its divisors is an integer number (530666070).
Almost surely, 25707504431 is an apocalyptic number.
5707504431 is a deficient number, since it is larger than the sum of its proper divisors (2783152689).
5707504431 is a wasteful number, since it uses less digits than its factorization.
5707504431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877383 (or 877377 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 36.
The square root of 5707504431 is about 75548.0273137559. The cubic root of 5707504431 is about 1787.0995787249.
The spelling of 5707504431 in words is "five billion, seven hundred seven million, five hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •