Base | Representation |
---|---|
bin | 11111000001010100101011… |
… | …010011110111000001100111 |
3 | 122220001121121120001102220202 |
4 | 133001110223103313001213 |
5 | 120340233340333040342 |
6 | 1202055124325021115 |
7 | 40510524400422446 |
oct | 3701245323670147 |
9 | 586047546042822 |
10 | 136430362783847 |
11 | 3a51a879071970 |
12 | 1337515055479b |
13 | 5b184358292b2 |
14 | 259939c832d5d |
15 | 10b8d00815332 |
hex | 7c152b4f7067 |
136430362783847 has 8 divisors (see below), whose sum is σ = 148875513601152. Its totient is φ = 123992277060600.
The previous prime is 136430362783753. The next prime is 136430362783849. The reversal of 136430362783847 is 748387263034631.
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 136430362783847 - 28 = 136430362783591 is a prime.
It is a super-2 number, since 2×1364303627838472 (a number of 29 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 (136430362783849) 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, 1766233133 + ... + 1766310374.
It is an arithmetic number, because the mean of its divisors is an integer number (18609439200144).
Almost surely, 2136430362783847 is an apocalyptic number.
136430362783847 is a deficient number, since it is larger than the sum of its proper divisors (12445150817305).
136430362783847 is a wasteful number, since it uses less digits than its factorization.
136430362783847 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3532547029.
The product of its (nonzero) digits is 292626432, while the sum is 65.
The spelling of 136430362783847 in words is "one hundred thirty-six trillion, four hundred thirty billion, three hundred sixty-two million, seven hundred eighty-three thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •