Base | Representation |
---|---|
bin | 1111110101111000100… |
… | …11010010111100100011 |
3 | 1221000222221121202210012 |
4 | 13322330103102330203 |
5 | 32404234203213433 |
6 | 1054020502555135 |
7 | 54216611422625 |
oct | 7727423227443 |
9 | 1830887552705 |
10 | 544325054243 |
11 | 19a935336833 |
12 | 895b1438aab |
13 | 3c439282619 |
14 | 1c4b9d9ac15 |
15 | e25c19c848 |
hex | 7ebc4d2f23 |
544325054243 has 4 divisors (see below), whose sum is σ = 553550902680. Its totient is φ = 535099205808.
The previous prime is 544325054239. The next prime is 544325054257. The reversal of 544325054243 is 342450523445.
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 544325054243 - 22 = 544325054239 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 544325054243.
It is not an unprimeable number, because it can be changed into a prime (544325054743) 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 3 ways as a sum of consecutive naturals, for example, 4612924130 + ... + 4612924247.
It is an arithmetic number, because the mean of its divisors is an integer number (138387725670).
Almost surely, 2544325054243 is an apocalyptic number.
544325054243 is a deficient number, since it is larger than the sum of its proper divisors (9225848437).
544325054243 is an equidigital number, since it uses as much as digits as its factorization.
544325054243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9225848436.
The product of its (nonzero) digits is 1152000, while the sum is 41.
Adding to 544325054243 its reverse (342450523445), we get a palindrome (886775577688).
The spelling of 544325054243 in words is "five hundred forty-four billion, three hundred twenty-five million, fifty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •