Base | Representation |
---|---|
bin | 111111000000110110… |
… | …0000100101100101001 |
3 | 110221021200002010011022 |
4 | 1332001230010230221 |
5 | 4204113332104432 |
6 | 142055352542225 |
7 | 12530231220101 |
oct | 1760154045451 |
9 | 427250063138 |
10 | 135319800617 |
11 | 52430555071 |
12 | 222863b1975 |
13 | c9b7074951 |
14 | 6799c16201 |
15 | 37beddab12 |
hex | 1f81b04b29 |
135319800617 has 4 divisors (see below), whose sum is σ = 135468341376. Its totient is φ = 135171259860.
The previous prime is 135319800613. The next prime is 135319800647. The reversal of 135319800617 is 716008913531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 135319800617 - 22 = 135319800613 is a prime.
It is a super-2 number, since 2×1353198006172 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135319800613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74269013 + ... + 74270834.
It is an arithmetic number, because the mean of its divisors is an integer number (33867085344).
Almost surely, 2135319800617 is an apocalyptic number.
It is an amenable number.
135319800617 is a deficient number, since it is larger than the sum of its proper divisors (148540759).
135319800617 is an equidigital number, since it uses as much as digits as its factorization.
135319800617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148540758.
The product of its (nonzero) digits is 136080, while the sum is 44.
The spelling of 135319800617 in words is "one hundred thirty-five billion, three hundred nineteen million, eight hundred thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •