Base | Representation |
---|---|
bin | 1001100001110011… |
… | …01101000101111100 |
3 | 111012111112021101110 |
4 | 10300321231011330 |
5 | 40434020304242 |
6 | 2203332442020 |
7 | 240523121202 |
oct | 46071550574 |
9 | 14174467343 |
10 | 5115400572 |
11 | 2195568187 |
12 | ba9179310 |
13 | 636a35159 |
14 | 367541072 |
15 | 1ee14e39c |
hex | 130e6d17c |
5115400572 has 72 divisors (see below), whose sum is σ = 12974596096. Its totient is φ = 1567464192.
The previous prime is 5115400541. The next prime is 5115400573. The reversal of 5115400572 is 2750045115.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5115400573) 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 23 ways as a sum of consecutive naturals, for example, 131973 + ... + 166275.
Almost surely, 25115400572 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 5115400572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6487298048).
5115400572 is an abundant number, since it is smaller than the sum of its proper divisors (7859195524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5115400572 is a wasteful number, since it uses less digits than its factorization.
5115400572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34387 (or 34368 counting only the distinct ones).
The product of its (nonzero) digits is 7000, while the sum is 30.
The square root of 5115400572 is about 71522.0285786135. The cubic root of 5115400572 is about 1723.0314949453.
Adding to 5115400572 its reverse (2750045115), we get a palindrome (7865445687).
The spelling of 5115400572 in words is "five billion, one hundred fifteen million, four hundred thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •