Base | Representation |
---|---|
bin | 11111000001010000010001… |
… | …110111110100011110000100 |
3 | 122220001011102111020210001222 |
4 | 133001100101313310132010 |
5 | 120340144203101120102 |
6 | 1202053024013335512 |
7 | 40510266364264643 |
oct | 3701202167643604 |
9 | 586034374223058 |
10 | 136425641035652 |
11 | 3a518875834631 |
12 | 13374253197598 |
13 | 5b17b62522457 |
14 | 25990716c335a |
15 | 10b8b26023aa2 |
hex | 7c1411df4784 |
136425641035652 has 12 divisors (see below), whose sum is σ = 238744953848016. Its totient is φ = 68212797079080.
The previous prime is 136425641035603. The next prime is 136425641035667. The reversal of 136425641035652 is 256530146524631.
136425641035652 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1364256410356523 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 136425641035594 and 136425641035603.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18353027 + ... + 24691797.
It is an arithmetic number, because the mean of its divisors is an integer number (19895412820668).
Almost surely, 2136425641035652 is an apocalyptic number.
It is an amenable number.
136425641035652 is a deficient number, since it is larger than the sum of its proper divisors (102319312812364).
136425641035652 is a wasteful number, since it uses less digits than its factorization.
136425641035652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11719378 (or 11719376 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 53.
The spelling of 136425641035652 in words is "one hundred thirty-six trillion, four hundred twenty-five billion, six hundred forty-one million, thirty-five thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •