Base | Representation |
---|---|
bin | 1010101111011111… |
… | …01101001100110000 |
3 | 112212220210120120200 |
4 | 11113233231030300 |
5 | 43302333402432 |
6 | 2352132435200 |
7 | 262625315235 |
oct | 52757551460 |
9 | 15786716520 |
10 | 5767090992 |
11 | 249a410903 |
12 | 114b478b00 |
13 | 70ba5b6a0 |
14 | 3c9d0178c |
15 | 23b47ca7c |
hex | 157bed330 |
5767090992 has 120 divisors (see below), whose sum is σ = 17591259504. Its totient is φ = 1753062912.
The previous prime is 5767090969. The next prime is 5767090997. The reversal of 5767090992 is 2990907675.
It is not an unprimeable number, because it can be changed into a prime (5767090997) 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 23 ways as a sum of consecutive naturals, for example, 136818 + ... + 173934.
Almost surely, 25767090992 is an apocalyptic number.
5767090992 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5767090992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8795629752).
5767090992 is an abundant number, since it is smaller than the sum of its proper divisors (11824168512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5767090992 is a wasteful number, since it uses less digits than its factorization.
5767090992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37227 (or 37218 counting only the distinct ones).
The product of its (nonzero) digits is 2143260, while the sum is 54.
The square root of 5767090992 is about 75941.3654868017. The cubic root of 5767090992 is about 1793.2971896857.
The spelling of 5767090992 in words is "five billion, seven hundred sixty-seven million, ninety thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •