Base | Representation |
---|---|
bin | 111111010001010101… |
… | …0100101100111101111 |
3 | 110222201020010120102001 |
4 | 1332202222211213233 |
5 | 4211232000344221 |
6 | 142230315113131 |
7 | 12550026643153 |
oct | 1764252454757 |
9 | 428636116361 |
10 | 135873059311 |
11 | 52694888560 |
12 | 223bb7427a7 |
13 | ca74886462 |
14 | 680d4b3063 |
15 | 3803774391 |
hex | 1fa2aa59ef |
135873059311 has 8 divisors (see below), whose sum is σ = 148244431104. Its totient is φ = 123504900120.
The previous prime is 135873059299. The next prime is 135873059341. The reversal of 135873059311 is 113950378531.
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 135873059311 - 221 = 135870962159 is a prime.
It is a super-2 number, since 2×1358730593112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135873059341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 714285 + ... + 884278.
It is an arithmetic number, because the mean of its divisors is an integer number (18530553888).
Almost surely, 2135873059311 is an apocalyptic number.
135873059311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135873059311 is a deficient number, since it is larger than the sum of its proper divisors (12371371793).
135873059311 is a wasteful number, since it uses less digits than its factorization.
135873059311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1606301.
The product of its (nonzero) digits is 340200, while the sum is 46.
The spelling of 135873059311 in words is "one hundred thirty-five billion, eight hundred seventy-three million, fifty-nine thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •