Base | Representation |
---|---|
bin | 1001101001101010… |
… | …11110011110001000 |
3 | 111101002201102220120 |
4 | 10310311132132020 |
5 | 41102414312333 |
6 | 2214051223240 |
7 | 242254116162 |
oct | 46465363610 |
9 | 14332642816 |
10 | 5181400968 |
11 | 2219847267 |
12 | 10072a7b20 |
13 | 647603343 |
14 | 372201932 |
15 | 204d39db3 |
hex | 134d5e788 |
5181400968 has 64 divisors (see below), whose sum is σ = 13385588160. Its totient is φ = 1670098176.
The previous prime is 5181400967. The next prime is 5181400993. The reversal of 5181400968 is 8690041815.
It is not an unprimeable number, because it can be changed into a prime (5181400963) 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 15 ways as a sum of consecutive naturals, for example, 126846 + ... + 162642.
It is an arithmetic number, because the mean of its divisors is an integer number (209149815).
Almost surely, 25181400968 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 5181400968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6692794080).
5181400968 is an abundant number, since it is smaller than the sum of its proper divisors (8204187192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5181400968 is a wasteful number, since it uses less digits than its factorization.
5181400968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36006 (or 36002 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 42.
The square root of 5181400968 is about 71981.9489038745. The cubic root of 5181400968 is about 1730.4102035512.
The spelling of 5181400968 in words is "five billion, one hundred eighty-one million, four hundred thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •