Base | Representation |
---|---|
bin | 1000000010001011111… |
… | …0010110100100100101 |
3 | 111012021020202021111011 |
4 | 2000202332112210211 |
5 | 4230134041133242 |
6 | 143224054142221 |
7 | 12654256204114 |
oct | 2004276264445 |
9 | 435236667434 |
10 | 138025724197 |
11 | 53599a17549 |
12 | 22900651971 |
13 | 1002885366a |
14 | 697534bc7b |
15 | 38cc740d17 |
hex | 2022f96925 |
138025724197 has 2 divisors, whose sum is σ = 138025724198. Its totient is φ = 138025724196.
The previous prime is 138025724183. The next prime is 138025724299. The reversal of 138025724197 is 791427520831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103649226916 + 34376497281 = 321946^2 + 185409^2 .
It is an emirp because it is prime and its reverse (791427520831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 138025724197 - 219 = 138025199909 is a prime.
It is a super-2 number, since 2×1380257241972 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 138025724197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138025724107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69012862098 + 69012862099.
It is an arithmetic number, because the mean of its divisors is an integer number (69012862099).
Almost surely, 2138025724197 is an apocalyptic number.
It is an amenable number.
138025724197 is a deficient number, since it is larger than the sum of its proper divisors (1).
138025724197 is an equidigital number, since it uses as much as digits as its factorization.
138025724197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 846720, while the sum is 49.
The spelling of 138025724197 in words is "one hundred thirty-eight billion, twenty-five million, seven hundred twenty-four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •