Base | Representation |
---|---|
bin | 1010101110110111… |
… | …10111100010101000 |
3 | 112212120000100210211 |
4 | 11113123313202220 |
5 | 43300020443342 |
6 | 2351425150504 |
7 | 262533155332 |
oct | 52733674250 |
9 | 15776010724 |
10 | 5761890472 |
11 | 2497489658 |
12 | 114978b434 |
13 | 70a95a560 |
14 | 3c934a452 |
15 | 23aca1c17 |
hex | 1576f78a8 |
5761890472 has 32 divisors (see below), whose sum is σ = 11641351680. Its totient is φ = 2657787840.
The previous prime is 5761890443. The next prime is 5761890473. The reversal of 5761890472 is 2740981675.
It is a super-2 number, since 2×57618904722 = 66398763622648765568, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5761890473) 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, 174397 + ... + 204787.
It is an arithmetic number, because the mean of its divisors is an integer number (363792240).
Almost surely, 25761890472 is an apocalyptic number.
5761890472 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5761890472 is an abundant number, since it is smaller than the sum of its proper divisors (5879461208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5761890472 is a wasteful number, since it uses less digits than its factorization.
5761890472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32233 (or 32229 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 49.
The square root of 5761890472 is about 75907.1174001490. The cubic root of 5761890472 is about 1792.7579875930.
The spelling of 5761890472 in words is "five billion, seven hundred sixty-one million, eight hundred ninety thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •