Base | Representation |
---|---|
bin | 10111010011011010000010… |
… | …10011101110111001011011 |
3 | 20201102220121220011020021211 |
4 | 23221231001103232321123 |
5 | 23204041412212003233 |
6 | 300553155111043551 |
7 | 13536165530231542 |
oct | 1351550123567133 |
9 | 221386556136254 |
10 | 51244350500443 |
11 | 15367674a13631 |
12 | 58b75b93705b7 |
13 | 22794244b1849 |
14 | c92350011159 |
15 | 5dceb323e5cd |
hex | 2e9b414eee5b |
51244350500443 has 4 divisors (see below), whose sum is σ = 51250606686208. Its totient is φ = 51238094314680.
The previous prime is 51244350500363. The next prime is 51244350500479. The reversal of 51244350500443 is 34400505344215.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51244350500443 - 229 = 51243813629531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51244350500396 and 51244350500405.
It is not an unprimeable number, because it can be changed into a prime (51244350506443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3128080596 + ... + 3128096977.
It is an arithmetic number, because the mean of its divisors is an integer number (12812651671552).
Almost surely, 251244350500443 is an apocalyptic number.
51244350500443 is a deficient number, since it is larger than the sum of its proper divisors (6256185765).
51244350500443 is an equidigital number, since it uses as much as digits as its factorization.
51244350500443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6256185764.
The product of its (nonzero) digits is 576000, while the sum is 40.
Adding to 51244350500443 its reverse (34400505344215), we get a palindrome (85644855844658).
The spelling of 51244350500443 in words is "fifty-one trillion, two hundred forty-four billion, three hundred fifty million, five hundred thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.554 sec. • engine limits •