Base | Representation |
---|---|
bin | 1001100100111001… |
… | …11011001101000000 |
3 | 111021022110201110201 |
4 | 10302130323031000 |
5 | 41012200114444 |
6 | 2210102134544 |
7 | 241260161230 |
oct | 46234731500 |
9 | 14238421421 |
10 | 5141410624 |
11 | 21a9212999 |
12 | bb5a21454 |
13 | 63c24100c |
14 | 36ab91cc0 |
15 | 20158add4 |
hex | 13273b340 |
5141410624 has 112 divisors (see below), whose sum is σ = 11956092928. Its totient is φ = 2148208128.
The previous prime is 5141410577. The next prime is 5141410649. The reversal of 5141410624 is 4260141415.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 5141410592 and 5141410601.
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, 3090817 + ... + 3092479.
Almost surely, 25141410624 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 5141410624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5978046464).
5141410624 is an abundant number, since it is smaller than the sum of its proper divisors (6814682304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5141410624 is a wasteful number, since it uses less digits than its factorization.
5141410624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852 (or 1842 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 5141410624 is about 71703.6304799136. The cubic root of 5141410624 is about 1725.9469000232.
The spelling of 5141410624 in words is "five billion, one hundred forty-one million, four hundred ten thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •