Base | Representation |
---|---|
bin | 11111001000011100111001… |
… | …010000011000000001011101 |
3 | 122221210110000202111221110112 |
4 | 133020130321100120001131 |
5 | 120421300104043220242 |
6 | 1203112140534015405 |
7 | 40561105523644535 |
oct | 3710347120300135 |
9 | 587713022457415 |
10 | 136920223023197 |
11 | 3a6995a4437089 |
12 | 134340817a7565 |
13 | 5b526a20344a3 |
14 | 25b4d8d1124c5 |
15 | 10c692117ec82 |
hex | 7c873941805d |
136920223023197 has 2 divisors, whose sum is σ = 136920223023198. Its totient is φ = 136920223023196.
The previous prime is 136920223023191. The next prime is 136920223023247. The reversal of 136920223023197 is 791320322029631.
It is an a-pointer prime, because the next prime (136920223023247) can be obtained adding 136920223023197 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119102867057476 + 17817355965721 = 10913426^2 + 4221061^2 .
It is a cyclic number.
It is not a de Polignac number, because 136920223023197 - 238 = 136645345116253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136920223023191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68460111511598 + 68460111511599.
It is an arithmetic number, because the mean of its divisors is an integer number (68460111511599).
Almost surely, 2136920223023197 is an apocalyptic number.
It is an amenable number.
136920223023197 is a deficient number, since it is larger than the sum of its proper divisors (1).
136920223023197 is an equidigital number, since it uses as much as digits as its factorization.
136920223023197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 50.
The spelling of 136920223023197 in words is "one hundred thirty-six trillion, nine hundred twenty billion, two hundred twenty-three million, twenty-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •