Base | Representation |
---|---|
bin | 111111010110100010… |
… | …0111100011011010111 |
3 | 111000011101211022010120 |
4 | 1332231010330123113 |
5 | 4212111210200011 |
6 | 142255515123023 |
7 | 12554250500145 |
oct | 1765504743327 |
9 | 430141738116 |
10 | 136047740631 |
11 | 52774448190 |
12 | 2244a143473 |
13 | caa1b1749a |
14 | 6828784595 |
15 | 3813c7ba06 |
hex | 1fad13c6d7 |
136047740631 has 128 divisors (see below), whose sum is σ = 213255659520. Its totient is φ = 76400755200.
The previous prime is 136047740603. The next prime is 136047740651.
136047740631 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 136047740631 - 25 = 136047740599 is a prime.
It is a super-2 number, since 2×1360477406312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136047740651) 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 127 ways as a sum of consecutive naturals, for example, 342689325 + ... + 342689721.
It is an arithmetic number, because the mean of its divisors is an integer number (1666059840).
Almost surely, 2136047740631 is an apocalyptic number.
136047740631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
136047740631 is a deficient number, since it is larger than the sum of its proper divisors (77207918889).
136047740631 is a wasteful number, since it uses less digits than its factorization.
136047740631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645.
The product of its (nonzero) digits is 254016, while the sum is 42.
It can be divided in two parts, 136047 and 740631, that added together give a palindrome (876678).
The spelling of 136047740631 in words is "one hundred thirty-six billion, forty-seven million, seven hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •