Base | Representation |
---|---|
bin | 111111000011100100… |
… | …0000011011011010011 |
3 | 110221112000201121201101 |
4 | 1332013020003123103 |
5 | 4204310210142043 |
6 | 142112412045231 |
7 | 12532416456211 |
oct | 1760710033323 |
9 | 427460647641 |
10 | 135411021523 |
11 | 52477a9a748 |
12 | 222b0a63817 |
13 | c9ccc3350b |
14 | 67a7d9dcb1 |
15 | 37c7e0924d |
hex | 1f872036d3 |
135411021523 has 8 divisors (see below), whose sum is σ = 135856447488. Its totient is φ = 134966074824.
The previous prime is 135411021521. The next prime is 135411021527. The reversal of 135411021523 is 325120114531.
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 135411021523 - 21 = 135411021521 is a prime.
It is a super-2 number, since 2×1354110215232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135411021491 and 135411021500.
It is not an unprimeable number, because it can be changed into a prime (135411021521) 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, 450640 + ... + 688402.
It is an arithmetic number, because the mean of its divisors is an integer number (16982055936).
Almost surely, 2135411021523 is an apocalyptic number.
135411021523 is a deficient number, since it is larger than the sum of its proper divisors (445425965).
135411021523 is a wasteful number, since it uses less digits than its factorization.
135411021523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239633.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 135411021523 in words is "one hundred thirty-five billion, four hundred eleven million, twenty-one thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •