Base | Representation |
---|---|
bin | 11110110101011011110000… |
… | …011111010110111001110111 |
3 | 122210011111201021210011112122 |
4 | 132311123300133112321313 |
5 | 120233342101012443043 |
6 | 1200231523231110155 |
7 | 40364511535604321 |
oct | 3665336037267167 |
9 | 583144637704478 |
10 | 135613332156023 |
11 | 3a23532262a447 |
12 | 1326293267235b |
13 | 5a89389424867 |
14 | 256ba126d8611 |
15 | 10a29322eb368 |
hex | 7b56f07d6e77 |
135613332156023 has 4 divisors (see below), whose sum is σ = 136023040108488. Its totient is φ = 135203624203560.
The previous prime is 135613332155963. The next prime is 135613332156061. The reversal of 135613332156023 is 320651233316531.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 135613332156023 - 222 = 135613327961719 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135613332156083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 204853975736 + ... + 204853976397.
It is an arithmetic number, because the mean of its divisors is an integer number (34005760027122).
Almost surely, 2135613332156023 is an apocalyptic number.
135613332156023 is a deficient number, since it is larger than the sum of its proper divisors (409707952465).
135613332156023 is an equidigital number, since it uses as much as digits as its factorization.
135613332156023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409707952464.
The product of its (nonzero) digits is 874800, while the sum is 44.
The spelling of 135613332156023 in words is "one hundred thirty-five trillion, six hundred thirteen billion, three hundred thirty-two million, one hundred fifty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •