Base | Representation |
---|---|
bin | 111001111001101011… |
… | …1110110111001111101 |
3 | 102212221121210022211001 |
4 | 1303303113312321331 |
5 | 4014123100430411 |
6 | 133042204530301 |
7 | 11661213164254 |
oct | 1636327667175 |
9 | 385847708731 |
10 | 124342201981 |
11 | 48807a277a8 |
12 | 20121b50991 |
13 | b95799175a |
14 | 6037cd779b |
15 | 337b2c3dc1 |
hex | 1cf35f6e7d |
124342201981 has 2 divisors, whose sum is σ = 124342201982. Its totient is φ = 124342201980.
The previous prime is 124342201979. The next prime is 124342202003. The reversal of 124342201981 is 189102243421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124189284025 + 152917956 = 352405^2 + 12366^2 .
It is a cyclic number.
It is not a de Polignac number, because 124342201981 - 21 = 124342201979 is a prime.
It is a super-2 number, since 2×1243422019812 (a number of 23 digits) contains 22 as substring.
Together with 124342201979, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 124342201981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124342201931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62171100990 + 62171100991.
It is an arithmetic number, because the mean of its divisors is an integer number (62171100991).
Almost surely, 2124342201981 is an apocalyptic number.
It is an amenable number.
124342201981 is a deficient number, since it is larger than the sum of its proper divisors (1).
124342201981 is an equidigital number, since it uses as much as digits as its factorization.
124342201981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 37.
The spelling of 124342201981 in words is "one hundred twenty-four billion, three hundred forty-two million, two hundred one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •