Base | Representation |
---|---|
bin | 111111000111110111… |
… | …0000011100101001001 |
3 | 110221220002000201021002 |
4 | 1332033232003211021 |
5 | 4210104112420403 |
6 | 142135002224345 |
7 | 12536120125445 |
oct | 1761756034511 |
9 | 427802021232 |
10 | 135555201353 |
11 | 52541417130 |
12 | 223311b50b5 |
13 | ca23a75220 |
14 | 67bd1b1825 |
15 | 37d58d9188 |
hex | 1f8fb83949 |
135555201353 has 8 divisors (see below), whose sum is σ = 159253663296. Its totient is φ = 113752616400.
The previous prime is 135555201337. The next prime is 135555201371. The reversal of 135555201353 is 353102555531.
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 135555201353 - 24 = 135555201337 is a prime.
It is a super-2 number, since 2×1355552013532 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (135555201053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 473969093 + ... + 473969378.
It is an arithmetic number, because the mean of its divisors is an integer number (19906707912).
Almost surely, 2135555201353 is an apocalyptic number.
135555201353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
135555201353 is a deficient number, since it is larger than the sum of its proper divisors (23698461943).
135555201353 is a wasteful number, since it uses less digits than its factorization.
135555201353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947938495.
The product of its (nonzero) digits is 168750, while the sum is 38.
Adding to 135555201353 its reverse (353102555531), we get a palindrome (488657756884).
The spelling of 135555201353 in words is "one hundred thirty-five billion, five hundred fifty-five million, two hundred one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •