Base | Representation |
---|---|
bin | 1100000011100010110011… |
… | …1100000010011011010111 |
3 | 1201221011112100021210212022 |
4 | 3000320230330002123113 |
5 | 3214132241342332133 |
6 | 44105135024443355 |
7 | 2535433553416565 |
oct | 300705474023327 |
9 | 51834470253768 |
10 | 13255023011543 |
11 | 4250472a28955 |
12 | 15a0ab447955b |
13 | 751c355a1c91 |
14 | 33b7919a8a35 |
15 | 17ebd8450998 |
hex | c0e2cf026d7 |
13255023011543 has 8 divisors (see below), whose sum is σ = 13270329887616. Its totient is φ = 13239723439800.
The previous prime is 13255023011537. The next prime is 13255023011579. The reversal of 13255023011543 is 34511032055231.
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 13255023011543 - 26 = 13255023011479 is a prime.
It is a super-2 number, since 2×132550230115432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13255023014543) 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, 1809548 + ... + 5457518.
It is an arithmetic number, because the mean of its divisors is an integer number (1658791235952).
Almost surely, 213255023011543 is an apocalyptic number.
13255023011543 is a deficient number, since it is larger than the sum of its proper divisors (15306876073).
13255023011543 is a wasteful number, since it uses less digits than its factorization.
13255023011543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3652165.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 13255023011543 its reverse (34511032055231), we get a palindrome (47766055066774).
The spelling of 13255023011543 in words is "thirteen trillion, two hundred fifty-five billion, twenty-three million, eleven thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •