Base | Representation |
---|---|
bin | 11111000000000000100011… |
… | …010000010011101000000101 |
3 | 122212201222110100020022101102 |
4 | 133000000203100103220011 |
5 | 120332243342012241402 |
6 | 1201545425135105445 |
7 | 40501146060600266 |
oct | 3700004320235005 |
9 | 585658410208342 |
10 | 136340033321477 |
11 | 3a495535483927 |
12 | 1335b741372285 |
13 | 5b0ca6b691b8b |
14 | 2594c6dc9296d |
15 | 10b67b55aa102 |
hex | 7c0023413a05 |
136340033321477 has 2 divisors, whose sum is σ = 136340033321478. Its totient is φ = 136340033321476.
The previous prime is 136340033321407. The next prime is 136340033321483. The reversal of 136340033321477 is 774123330043631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78978662356036 + 57361370965441 = 8886994^2 + 7573729^2 .
It is a cyclic number.
It is not a de Polignac number, because 136340033321477 - 212 = 136340033317381 is a prime.
It is a super-2 number, since 2×1363400333214772 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136340033321407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68170016660738 + 68170016660739.
It is an arithmetic number, because the mean of its divisors is an integer number (68170016660739).
Almost surely, 2136340033321477 is an apocalyptic number.
It is an amenable number.
136340033321477 is a deficient number, since it is larger than the sum of its proper divisors (1).
136340033321477 is an equidigital number, since it uses as much as digits as its factorization.
136340033321477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2286144, while the sum is 47.
The spelling of 136340033321477 in words is "one hundred thirty-six trillion, three hundred forty billion, thirty-three million, three hundred twenty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •