Base | Representation |
---|---|
bin | 111111100001001101… |
… | …1111111001111111011 |
3 | 111001002101010222221012 |
4 | 1333002123333033323 |
5 | 4213324430244120 |
6 | 142355240104135 |
7 | 12566161513406 |
oct | 1770233771773 |
9 | 431071128835 |
10 | 136406103035 |
11 | 52938764164 |
12 | 2252a16504b |
13 | cb2b13aa47 |
14 | 68601cad3d |
15 | 38354681c5 |
hex | 1fc26ff3fb |
136406103035 has 8 divisors (see below), whose sum is σ = 163725656640. Its totient is φ = 109099327104.
The previous prime is 136406103023. The next prime is 136406103101. The reversal of 136406103035 is 530301604631.
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 136406103035 - 24 = 136406103019 is a prime.
It is a super-2 number, since 2×1364061030352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136406102992 and 136406103010.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3170915 + ... + 3213644.
It is an arithmetic number, because the mean of its divisors is an integer number (20465707080).
Almost surely, 2136406103035 is an apocalyptic number.
136406103035 is a deficient number, since it is larger than the sum of its proper divisors (27319553605).
136406103035 is an equidigital number, since it uses as much as digits as its factorization.
136406103035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6388837.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 136406103035 its reverse (530301604631), we get a palindrome (666707707666).
The spelling of 136406103035 in words is "one hundred thirty-six billion, four hundred six million, one hundred three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •