Base | Representation |
---|---|
bin | 11111000110110100000110… |
… | …101111010011001111111101 |
3 | 122221101200121021112100001110 |
4 | 133012310012233103033331 |
5 | 120412424140310424042 |
6 | 1202544332003032233 |
7 | 40550013332642346 |
oct | 3706640657231775 |
9 | 587350537470043 |
10 | 136807706342397 |
11 | 3a65590572a492 |
12 | 1341630006b679 |
13 | 5b44bb031775c |
14 | 25ad7579b90cd |
15 | 10c3a3816409c |
hex | 7c6d06bd33fd |
136807706342397 has 16 divisors (see below), whose sum is σ = 182882409016320. Its totient is φ = 90969239063472.
The previous prime is 136807706342393. The next prime is 136807706342401. The reversal of 136807706342397 is 793243607708631.
It is an interprime number because it is at equal distance from previous prime (136807706342393) and next prime (136807706342401).
It is not a de Polignac number, because 136807706342397 - 22 = 136807706342393 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136807706342393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17805783 + ... + 24303524.
It is an arithmetic number, because the mean of its divisors is an integer number (11430150563520).
Almost surely, 2136807706342397 is an apocalyptic number.
It is an amenable number.
136807706342397 is a deficient number, since it is larger than the sum of its proper divisors (46074702673923).
136807706342397 is a wasteful number, since it uses less digits than its factorization.
136807706342397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42112112.
The product of its (nonzero) digits is 192036096, while the sum is 66.
The spelling of 136807706342397 in words is "one hundred thirty-six trillion, eight hundred seven billion, seven hundred six million, three hundred forty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •