Base | Representation |
---|---|
bin | 10011101111011000001… |
… | …111100011111010011001 |
3 | 11210200110210022222211021 |
4 | 103233120033203322121 |
5 | 134211144404444103 |
6 | 2515104225002441 |
7 | 200002251216406 |
oct | 23573017437231 |
9 | 4720423288737 |
10 | 1356542656153 |
11 | 483340a67693 |
12 | 19aaa7483421 |
13 | 9abc94a1829 |
14 | 4992abc52ad |
15 | 25447d94bbd |
hex | 13bd83e3e99 |
1356542656153 has 4 divisors (see below), whose sum is σ = 1356695756388. Its totient is φ = 1356389555920.
The previous prime is 1356542656087. The next prime is 1356542656187. The reversal of 1356542656153 is 3516562456531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1044723161689 + 311819494464 = 1022117^2 + 558408^2 .
It is a cyclic number.
It is not a de Polignac number, because 1356542656153 - 29 = 1356542655641 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 1356542656153.
It is not an unprimeable number, because it can be changed into a prime (1356542656853) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76536826 + ... + 76554547.
It is an arithmetic number, because the mean of its divisors is an integer number (339173939097).
Almost surely, 21356542656153 is an apocalyptic number.
It is an amenable number.
1356542656153 is a deficient number, since it is larger than the sum of its proper divisors (153100235).
1356542656153 is an equidigital number, since it uses as much as digits as its factorization.
1356542656153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153100234.
The product of its digits is 9720000, while the sum is 52.
The spelling of 1356542656153 in words is "one trillion, three hundred fifty-six billion, five hundred forty-two million, six hundred fifty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •