Base | Representation |
---|---|
bin | 100110001100111110100… |
… | …1110101101100000101101 |
3 | 200120221120221002220222201 |
4 | 1030121331032231200231 |
5 | 1142011112031403031 |
6 | 15100023030541501 |
7 | 1051224356332444 |
oct | 114317516554055 |
9 | 20527527086881 |
10 | 5250551044141 |
11 | 1744823201397 |
12 | 709712b07891 |
13 | 2c118136a980 |
14 | 1421b1439d5b |
15 | 918a3ad7d61 |
hex | 4c67d3ad82d |
5250551044141 has 64 divisors (see below), whose sum is σ = 6259489367040. Its totient is φ = 4359656079360.
The previous prime is 5250551044133. The next prime is 5250551044159. The reversal of 5250551044141 is 1414401550525.
It is a cyclic number.
It is not a de Polignac number, because 5250551044141 - 23 = 5250551044133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5250551044141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5250551044121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 88041565 + ... + 88101181.
It is an arithmetic number, because the mean of its divisors is an integer number (97804521360).
Almost surely, 25250551044141 is an apocalyptic number.
It is an amenable number.
5250551044141 is a deficient number, since it is larger than the sum of its proper divisors (1008938322899).
5250551044141 is a wasteful number, since it uses less digits than its factorization.
5250551044141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59894.
The product of its (nonzero) digits is 80000, while the sum is 37.
Adding to 5250551044141 its reverse (1414401550525), we get a palindrome (6664952594666).
The spelling of 5250551044141 in words is "five trillion, two hundred fifty billion, five hundred fifty-one million, forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •