Base | Representation |
---|---|
bin | 111111110001000010… |
… | …1000010110111011011 |
3 | 111002110101001022000221 |
4 | 1333202011002313123 |
5 | 4220421330200301 |
6 | 142524042140511 |
7 | 12615265643635 |
oct | 1774205026733 |
9 | 432411038027 |
10 | 136936959451 |
11 | 53090386476 |
12 | 22657ab1737 |
13 | cbb4107876 |
14 | 68b08d5a55 |
15 | 3866d78da1 |
hex | 1fe2142ddb |
136936959451 has 8 divisors (see below), whose sum is σ = 141663132000. Its totient is φ = 132211067520.
The previous prime is 136936959427. The next prime is 136936959499. The reversal of 136936959451 is 154959639631.
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 136936959451 - 27 = 136936959323 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136936959451.
It is not an unprimeable number, because it can be changed into a prime (136936959421) 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, 1584250 + ... + 1668448.
It is an arithmetic number, because the mean of its divisors is an integer number (17707891500).
Almost surely, 2136936959451 is an apocalyptic number.
136936959451 is a deficient number, since it is larger than the sum of its proper divisors (4726172549).
136936959451 is an equidigital number, since it uses as much as digits as its factorization.
136936959451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140309.
The product of its digits is 23619600, while the sum is 61.
The spelling of 136936959451 in words is "one hundred thirty-six billion, nine hundred thirty-six million, nine hundred fifty-nine thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •