Base | Representation |
---|---|
bin | 11111011010010100111111… |
… | …001101010010011101011011 |
3 | 200010010212220021200021211202 |
4 | 133122110333031102131123 |
5 | 121101412000440231211 |
6 | 1205452343513544415 |
7 | 41045625106630433 |
oct | 3732247715223533 |
9 | 603125807607752 |
10 | 138148683523931 |
11 | 40022589358663 |
12 | 135b218271510b |
13 | 5c11498a72372 |
14 | 261860941d2c3 |
15 | 10e886e74653b |
hex | 7da53f35275b |
138148683523931 has 2 divisors, whose sum is σ = 138148683523932. Its totient is φ = 138148683523930.
The previous prime is 138148683523901. The next prime is 138148683523951. The reversal of 138148683523931 is 139325386841831.
It is a strong prime.
It is an emirp because it is prime and its reverse (139325386841831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 138148683523931 - 214 = 138148683507547 is a prime.
It is a super-2 number, since 2×1381486835239312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (138148683523901) 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 as a sum of consecutive naturals, namely, 69074341761965 + 69074341761966.
It is an arithmetic number, because the mean of its divisors is an integer number (69074341761966).
Almost surely, 2138148683523931 is an apocalyptic number.
138148683523931 is a deficient number, since it is larger than the sum of its proper divisors (1).
138148683523931 is an equidigital number, since it uses as much as digits as its factorization.
138148683523931 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 89579520, while the sum is 65.
The spelling of 138148683523931 in words is "one hundred thirty-eight trillion, one hundred forty-eight billion, six hundred eighty-three million, five hundred twenty-three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •