Base | Representation |
---|---|
bin | 111111110100111101… |
… | …0011011111101101101 |
3 | 111002210112100222121222 |
4 | 1333221322123331231 |
5 | 4221204002141042 |
6 | 142545055233125 |
7 | 12621453101012 |
oct | 1775172337555 |
9 | 432715328558 |
10 | 137068396397 |
11 | 53148599a49 |
12 | 22693b187a5 |
13 | cc054073ca |
14 | 68c414b709 |
15 | 387368d2d2 |
hex | 1fe9e9bf6d |
137068396397 has 2 divisors, whose sum is σ = 137068396398. Its totient is φ = 137068396396.
The previous prime is 137068396391. The next prime is 137068396411. The reversal of 137068396397 is 793693860731.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133098010276 + 3970386121 = 364826^2 + 63011^2 .
It is a cyclic number.
It is not a de Polignac number, because 137068396397 - 28 = 137068396141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137068396391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68534198198 + 68534198199.
It is an arithmetic number, because the mean of its divisors is an integer number (68534198199).
Almost surely, 2137068396397 is an apocalyptic number.
It is an amenable number.
137068396397 is a deficient number, since it is larger than the sum of its proper divisors (1).
137068396397 is an equidigital number, since it uses as much as digits as its factorization.
137068396397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30862944, while the sum is 62.
The spelling of 137068396397 in words is "one hundred thirty-seven billion, sixty-eight million, three hundred ninety-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •