Base | Representation |
---|---|
bin | 11000010110010100010010… |
… | …10101001001100001000111 |
3 | 21000120200210021001022011211 |
4 | 30023022021111021201013 |
5 | 24004223303240201120 |
6 | 305513252151112251 |
7 | 14164244350340020 |
oct | 1413121125114107 |
9 | 230520707038154 |
10 | 53543366334535 |
11 | 16073683472260 |
12 | 6009091072687 |
13 | 23b516b9bc80c |
14 | d31727017c47 |
15 | 62cbbc2c625a |
hex | 30b289549847 |
53543366334535 has 16 divisors (see below), whose sum is σ = 80106438984192. Its totient is φ = 33377682909600.
The previous prime is 53543366334509. The next prime is 53543366334547.
53543366334535 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 53543366334535 - 27 = 53543366334407 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 53543366334535.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69536839011 + ... + 69536839780.
It is an arithmetic number, because the mean of its divisors is an integer number (5006652436512).
Almost surely, 253543366334535 is an apocalyptic number.
53543366334535 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
53543366334535 is a deficient number, since it is larger than the sum of its proper divisors (26563072649657).
53543366334535 is a wasteful number, since it uses less digits than its factorization.
53543366334535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139073678814.
The product of its digits is 262440000, while the sum is 58.
The spelling of 53543366334535 in words is "fifty-three trillion, five hundred forty-three billion, three hundred sixty-six million, three hundred thirty-four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •