Base | Representation |
---|---|
bin | 10110011010101010001… |
… | …011000011001000111111 |
3 | 12110021011211200110200111 |
4 | 112122222023003020333 |
5 | 200214322022041020 |
6 | 3135401404410451 |
7 | 216202604063560 |
oct | 26325213031077 |
9 | 5407154613614 |
10 | 1540453315135 |
11 | 544336811839 |
12 | 20a672846a27 |
13 | b2358386777 |
14 | 547b611a167 |
15 | 2a10da76d5a |
hex | 166aa2c323f |
1540453315135 has 64 divisors (see below), whose sum is σ = 2185254063360. Its totient is φ = 1020756971520.
The previous prime is 1540453315133. The next prime is 1540453315151. The reversal of 1540453315135 is 5315133540451.
It is not a de Polignac number, because 1540453315135 - 21 = 1540453315133 is a prime.
It is a super-2 number, since 2×15404533151352 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1540453315133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29806537 + ... + 29858173.
It is an arithmetic number, because the mean of its divisors is an integer number (34144594740).
Almost surely, 21540453315135 is an apocalyptic number.
1540453315135 is a deficient number, since it is larger than the sum of its proper divisors (644800748225).
1540453315135 is a wasteful number, since it uses less digits than its factorization.
1540453315135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51956.
The product of its (nonzero) digits is 270000, while the sum is 40.
Adding to 1540453315135 its reverse (5315133540451), we get a palindrome (6855586855586).
The spelling of 1540453315135 in words is "one trillion, five hundred forty billion, four hundred fifty-three million, three hundred fifteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •