Base | Representation |
---|---|
bin | 1010110000000101… |
… | …11111010101010000 |
3 | 112220021022101202012 |
4 | 11120002333111100 |
5 | 43310132133000 |
6 | 2352433042052 |
7 | 263016300665 |
oct | 53002772520 |
9 | 15807271665 |
10 | 5772146000 |
11 | 24a22537a5 |
12 | 11510b6328 |
13 | 70cb0b50a |
14 | 3ca859a6c |
15 | 23bb2a735 |
hex | 1580bf550 |
5772146000 has 80 divisors (see below), whose sum is σ = 14778138960. Its totient is φ = 2173030400.
The previous prime is 5772145963. The next prime is 5772146027. The reversal of 5772146000 is 6412775.
It can be written as a sum of positive squares in 8 ways, for example, as 34386496 + 5737759504 = 5864^2 + 75748^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50885 + ... + 118884.
It is an arithmetic number, because the mean of its divisors is an integer number (184726737).
Almost surely, 25772146000 is an apocalyptic number.
5772146000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5772146000 is an abundant number, since it is smaller than the sum of its proper divisors (9005992960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5772146000 is a wasteful number, since it uses less digits than its factorization.
5772146000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169809 (or 169793 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 32.
The square root of 5772146000 is about 75974.6405058951. The cubic root of 5772146000 is about 1793.8209941671.
Adding to 5772146000 its reverse (6412775), we get a palindrome (5778558775).
The spelling of 5772146000 in words is "five billion, seven hundred seventy-two million, one hundred forty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •