Base | Representation |
---|---|
bin | 100101000000110001101… |
… | …011111111100011001111 |
3 | 100000011002200220110011222 |
4 | 211000301223333203033 |
5 | 313132443242132221 |
6 | 5224240255433555 |
7 | 351521111312414 |
oct | 45006153774317 |
9 | 10004080813158 |
10 | 2543454255311 |
11 | 8a074468a482 |
12 | 350b318258bb |
13 | 155b012a5748 |
14 | 8b164d3210b |
15 | 462639ba9ab |
hex | 25031aff8cf |
2543454255311 has 8 divisors (see below), whose sum is σ = 2552943744000. Its totient is φ = 2533967873920.
The previous prime is 2543454255271. The next prime is 2543454255443. The reversal of 2543454255311 is 1135524543452.
It is a happy number.
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 2543454255311 - 210 = 2543454254287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2543454251311) 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 7 ways as a sum of consecutive naturals, for example, 869810 + ... + 2417328.
It is an arithmetic number, because the mean of its divisors is an integer number (319117968000).
Almost surely, 22543454255311 is an apocalyptic number.
2543454255311 is a deficient number, since it is larger than the sum of its proper divisors (9489488689).
2543454255311 is a wasteful number, since it uses less digits than its factorization.
2543454255311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1553649.
The product of its digits is 1440000, while the sum is 44.
Adding to 2543454255311 its reverse (1135524543452), we get a palindrome (3678978798763).
The spelling of 2543454255311 in words is "two trillion, five hundred forty-three billion, four hundred fifty-four million, two hundred fifty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •