Base | Representation |
---|---|
bin | 100100110100110101000… |
… | …0001110100000110100101 |
3 | 122220211222020102112112100 |
4 | 1021221222001310012211 |
5 | 1130410420041211031 |
6 | 14433034543442313 |
7 | 1031443334006610 |
oct | 111515201640645 |
9 | 18824866375470 |
10 | 5061250335141 |
11 | 168151195a950 |
12 | 698aa25b6399 |
13 | 2a937388a720 |
14 | 136d7430d177 |
15 | 8b9c4b03de6 |
hex | 49a6a0741a5 |
5061250335141 has 192 divisors, whose sum is σ = 9890107508736. Its totient is φ = 2408659545600.
The previous prime is 5061250335101. The next prime is 5061250335151. The reversal of 5061250335141 is 1415330521605.
5061250335141 is a `hidden beast` number, since 5 + 0 + 6 + 1 + 2 + 503 + 3 + 5 + 141 = 666.
It is not a de Polignac number, because 5061250335141 - 214 = 5061250318757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5061250335096 and 5061250335105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5061250335101) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 676905495 + ... + 676912971.
It is an arithmetic number, because the mean of its divisors is an integer number (51510976608).
Almost surely, 25061250335141 is an apocalyptic number.
It is an amenable number.
5061250335141 is a deficient number, since it is larger than the sum of its proper divisors (4828857173595).
5061250335141 is a wasteful number, since it uses less digits than its factorization.
5061250335141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8072 (or 8069 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
Adding to 5061250335141 its reverse (1415330521605), we get a palindrome (6476580856746).
The spelling of 5061250335141 in words is "five trillion, sixty-one billion, two hundred fifty million, three hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •