Base | Representation |
---|---|
bin | 111111100010011111… |
… | …1101010110010011111 |
3 | 111001012100212221101102 |
4 | 1333010333222302133 |
5 | 4213421421321342 |
6 | 142403411503315 |
7 | 12600222312152 |
oct | 1770477526237 |
9 | 431170787342 |
10 | 136449010847 |
11 | 5295aa00466 |
12 | 225405b7b3b |
13 | cb36cb1c96 |
14 | 6865b99c99 |
15 | 38390e1832 |
hex | 1fc4feac9f |
136449010847 has 4 divisors (see below), whose sum is σ = 142381576560. Its totient is φ = 130516445136.
The previous prime is 136449010813. The next prime is 136449010871. The reversal of 136449010847 is 748010944631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136449010847 - 212 = 136449006751 is a prime.
It is a super-2 number, since 2×1364490108472 (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 (136449010877) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2966282822 + ... + 2966282867.
It is an arithmetic number, because the mean of its divisors is an integer number (35595394140).
Almost surely, 2136449010847 is an apocalyptic number.
136449010847 is a deficient number, since it is larger than the sum of its proper divisors (5932565713).
136449010847 is an equidigital number, since it uses as much as digits as its factorization.
136449010847 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5932565712.
The product of its (nonzero) digits is 580608, while the sum is 47.
The spelling of 136449010847 in words is "one hundred thirty-six billion, four hundred forty-nine million, ten thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •