Base | Representation |
---|---|
bin | 111111100111010100… |
… | …0000111110111000111 |
3 | 111001121121222001121121 |
4 | 1333032220013313013 |
5 | 4214234304020011 |
6 | 142431423254411 |
7 | 12604224013435 |
oct | 1771650076707 |
9 | 431547861547 |
10 | 136610610631 |
11 | 52a33145800 |
12 | 2258674a407 |
13 | cb61612961 |
14 | 687d423d55 |
15 | 38483b2e71 |
hex | 1fcea07dc7 |
136610610631 has 12 divisors (see below), whose sum is σ = 150757045992. Its totient is φ = 123696650000.
The previous prime is 136610610611. The next prime is 136610610673. The reversal of 136610610631 is 136016016631.
It is not a de Polignac number, because 136610610631 - 219 = 136610086343 is a prime.
It is a super-2 number, since 2×1366106106312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136610610601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2218660 + ... + 2279401.
It is an arithmetic number, because the mean of its divisors is an integer number (12563087166).
Almost surely, 2136610610631 is an apocalyptic number.
136610610631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
136610610631 is a deficient number, since it is larger than the sum of its proper divisors (14146435361).
136610610631 is a wasteful number, since it uses less digits than its factorization.
136610610631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4498334 (or 4498323 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 34.
The spelling of 136610610631 in words is "one hundred thirty-six billion, six hundred ten million, six hundred ten thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •