Base | Representation |
---|---|
bin | 1111110000100010000… |
… | …11111110100010001111 |
3 | 1220202120201201022211212 |
4 | 13320101003332202033 |
5 | 32332343221301133 |
6 | 1052423434205035 |
7 | 54055455130505 |
oct | 7702103764217 |
9 | 1822521638755 |
10 | 541452134543 |
11 | 1996a0683731 |
12 | 88b2b28377b |
13 | 3c09c003938 |
14 | 1c2c65d4675 |
15 | e13ed5c148 |
hex | 7e110fe88f |
541452134543 has 8 divisors (see below), whose sum is σ = 556334002896. Its totient is φ = 526650062400.
The previous prime is 541452134527. The next prime is 541452134563. The reversal of 541452134543 is 345431254145.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 541452134543 - 24 = 541452134527 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
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 541452134543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (541452134563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19935296 + ... + 19962437.
It is an arithmetic number, because the mean of its divisors is an integer number (69541750362).
Almost surely, 2541452134543 is an apocalyptic number.
541452134543 is a deficient number, since it is larger than the sum of its proper divisors (14881868353).
541452134543 is a wasteful number, since it uses less digits than its factorization.
541452134543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39898105.
The product of its digits is 576000, while the sum is 41.
Adding to 541452134543 its reverse (345431254145), we get a palindrome (886883388688).
The spelling of 541452134543 in words is "five hundred forty-one billion, four hundred fifty-two million, one hundred thirty-four thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •