Base | Representation |
---|---|
bin | 111111000011100100… |
… | …1111000100010110001 |
3 | 110221112001121222202102 |
4 | 1332013021320202301 |
5 | 4204310321014413 |
6 | 142112430230145 |
7 | 12532423524611 |
oct | 1760711704261 |
9 | 427461558672 |
10 | 135411501233 |
11 | 524782980a8 |
12 | 222b1055355 |
13 | ca00070978 |
14 | 67a8086a41 |
15 | 37c7ea1458 |
hex | 1f872788b1 |
135411501233 has 8 divisors (see below), whose sum is σ = 141163574016. Its totient is φ = 129745926000.
The previous prime is 135411501217. The next prime is 135411501287. The reversal of 135411501233 is 332105114531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135411501233 - 24 = 135411501217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135411501196 and 135411501205.
It is not an unprimeable number, because it can be changed into a prime (135411501733) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 21621191 + ... + 21627452.
It is an arithmetic number, because the mean of its divisors is an integer number (17645446752).
Almost surely, 2135411501233 is an apocalyptic number.
It is an amenable number.
135411501233 is a deficient number, since it is larger than the sum of its proper divisors (5752072783).
135411501233 is a wasteful number, since it uses less digits than its factorization.
135411501233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43248775.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 135411501233 its reverse (332105114531), we get a palindrome (467516615764).
The spelling of 135411501233 in words is "one hundred thirty-five billion, four hundred eleven million, five hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •