Base | Representation |
---|---|
bin | 111110111000000100… |
… | …1110110011010110001 |
3 | 110220112011112000111112 |
4 | 1331300021312122301 |
5 | 4203013024212221 |
6 | 142010243323105 |
7 | 12520026542453 |
oct | 1756011663261 |
9 | 426464460445 |
10 | 135025616561 |
11 | 5229a493250 |
12 | 22203980495 |
13 | c96b132144 |
14 | 676cb182d3 |
15 | 37a417a15b |
hex | 1f702766b1 |
135025616561 has 8 divisors (see below), whose sum is σ = 150893372448. Its totient is φ = 119756644000.
The previous prime is 135025616527. The next prime is 135025616587. The reversal of 135025616561 is 165616520531.
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 135025616561 - 26 = 135025616497 is a prime.
It is a super-3 number, since 3×1350256165613 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135025616521) 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, 149695355 + ... + 149696256.
It is an arithmetic number, because the mean of its divisors is an integer number (18861671556).
Almost surely, 2135025616561 is an apocalyptic number.
135025616561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
135025616561 is a deficient number, since it is larger than the sum of its proper divisors (15867755887).
135025616561 is a wasteful number, since it uses less digits than its factorization.
135025616561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 299391663.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 135025616561 in words is "one hundred thirty-five billion, twenty-five million, six hundred sixteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •