Base | Representation |
---|---|
bin | 1010000010110010… |
… | …11111101100101100 |
3 | 111220210022121100120 |
4 | 11001121133230230 |
5 | 42020343413042 |
6 | 2251020524540 |
7 | 250423454403 |
oct | 50131375454 |
9 | 14823277316 |
10 | 5392169772 |
11 | 2317814a60 |
12 | 10659b0750 |
13 | 67c18b102 |
14 | 3921c863a |
15 | 2185bedec |
hex | 14165fb2c |
5392169772 has 96 divisors (see below), whose sum is σ = 14565519360. Its totient is φ = 1536406080.
The previous prime is 5392169759. The next prime is 5392169779. The reversal of 5392169772 is 2779612935.
It is not an unprimeable number, because it can be changed into a prime (5392169779) 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 31 ways as a sum of consecutive naturals, for example, 164073 + ... + 194175.
It is an arithmetic number, because the mean of its divisors is an integer number (151724160).
Almost surely, 25392169772 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5392169772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7282759680).
5392169772 is an abundant number, since it is smaller than the sum of its proper divisors (9173349588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5392169772 is a wasteful number, since it uses less digits than its factorization.
5392169772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30203 (or 30201 counting only the distinct ones).
The product of its digits is 1428840, while the sum is 51.
The square root of 5392169772 is about 73431.3950024102. The cubic root of 5392169772 is about 1753.5622428877.
The spelling of 5392169772 in words is "five billion, three hundred ninety-two million, one hundred sixty-nine thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •