Base | Representation |
---|---|
bin | 100101001001011000111… |
… | …0010101110011011000000 |
3 | 200002001221101100201210210 |
4 | 1022102301302232123000 |
5 | 1132121331411342344 |
6 | 14505220142154120 |
7 | 1034565446040255 |
oct | 112226162563300 |
9 | 20061841321723 |
10 | 5105404012224 |
11 | 169920a515a6a |
12 | 6a5565582940 |
13 | 2b058c34a179 |
14 | 1391623d542c |
15 | 8cc0b0b9db9 |
hex | 4a4b1cae6c0 |
5105404012224 has 224 divisors, whose sum is σ = 14932260264960. Its totient is φ = 1531259158528.
The previous prime is 5105404012183. The next prime is 5105404012237. The reversal of 5105404012224 is 4222104045015.
It is a junction number, because it is equal to n+sod(n) for n = 5105404012191 and 5105404012200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 153055132 + ... + 153088484.
Almost surely, 25105404012224 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 5105404012224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7466130132480).
5105404012224 is an abundant number, since it is smaller than the sum of its proper divisors (9826856252736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5105404012224 is a wasteful number, since it uses less digits than its factorization.
5105404012224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35447 (or 35437 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 30.
Adding to 5105404012224 its reverse (4222104045015), we get a palindrome (9327508057239).
The spelling of 5105404012224 in words is "five trillion, one hundred five billion, four hundred four million, twelve thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •