Base | Representation |
---|---|
bin | 11110110100001110100111… |
… | …111011000011101101011101 |
3 | 122202212120221021212001121101 |
4 | 132310032213323003231131 |
5 | 120231012441114131140 |
6 | 1200125505031233101 |
7 | 40355520250504225 |
oct | 3664164773035535 |
9 | 582776837761541 |
10 | 135530510302045 |
11 | 3a203191879741 |
12 | 1324a879818791 |
13 | 5a8161a7b0581 |
14 | 25679d6c8b085 |
15 | 10a06d622799a |
hex | 7b43a7ec3b5d |
135530510302045 has 16 divisors (see below), whose sum is σ = 165990252453120. Its totient is φ = 106201916789184.
The previous prime is 135530510302013. The next prime is 135530510302069. The reversal of 135530510302045 is 540203015035531.
It is a cyclic number.
It is not a de Polignac number, because 135530510302045 - 25 = 135530510302013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135530510301995 and 135530510302013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 829206117 + ... + 829369546.
It is an arithmetic number, because the mean of its divisors is an integer number (10374390778320).
Almost surely, 2135530510302045 is an apocalyptic number.
It is an amenable number.
135530510302045 is a deficient number, since it is larger than the sum of its proper divisors (30459742151075).
135530510302045 is a wasteful number, since it uses less digits than its factorization.
135530510302045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1658576004.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 135530510302045 its reverse (540203015035531), we get a palindrome (675733525337576).
The spelling of 135530510302045 in words is "one hundred thirty-five trillion, five hundred thirty billion, five hundred ten million, three hundred two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •