Base | Representation |
---|---|
bin | 111110111010011001… |
… | …1011000001001101101 |
3 | 110220201121021120110000 |
4 | 1331310303120021231 |
5 | 4203143011032001 |
6 | 142022111134513 |
7 | 12521664515115 |
oct | 1756463301155 |
9 | 426647246400 |
10 | 135103611501 |
11 | 5232a514a81 |
12 | 22225b14439 |
13 | c98133c9b1 |
14 | 677921c045 |
15 | 37aae34a86 |
hex | 1f74cd826d |
135103611501 has 20 divisors (see below), whose sum is σ = 201833199612. Its totient is φ = 90063828288.
The previous prime is 135103611499. The next prime is 135103611509. The reversal of 135103611501 is 105116301531.
It is a happy number.
135103611501 is a `hidden beast` number, since 1 + 3 + 510 + 36 + 115 + 0 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 53038550601 + 82065060900 = 230301^2 + 286470^2 .
It is not a de Polignac number, because 135103611501 - 21 = 135103611499 is a prime.
It is a super-2 number, since 2×1351036115012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135103611509) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1767001 + ... + 1841873.
Almost surely, 2135103611501 is an apocalyptic number.
It is an amenable number.
135103611501 is a deficient number, since it is larger than the sum of its proper divisors (66729588111).
135103611501 is an equidigital number, since it uses as much as digits as its factorization.
135103611501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97162 (or 97153 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 27.
The spelling of 135103611501 in words is "one hundred thirty-five billion, one hundred three million, six hundred eleven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •