Base | Representation |
---|---|
bin | 11111011001011100100010… |
… | …100110010100000001010111 |
3 | 200002221002110022011120220102 |
4 | 133121130202212110001113 |
5 | 121044413333421040034 |
6 | 1205404441353324315 |
7 | 41041351126326404 |
oct | 3731344246240127 |
9 | 602832408146812 |
10 | 138088074002519 |
11 | 3aaa990690a0a3 |
12 | 135a248870669b |
13 | 5c08859c64824 |
14 | 26156d9a252ab |
15 | 10e6ec374497e |
hex | 7d9722994057 |
138088074002519 has 2 divisors, whose sum is σ = 138088074002520. Its totient is φ = 138088074002518.
The previous prime is 138088074002407. The next prime is 138088074002521. The reversal of 138088074002519 is 915200470880831.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 138088074002519 - 240 = 136988562374743 is a prime.
It is a super-2 number, since 2×1380880740025192 (a number of 29 digits) contains 22 as substring.
Together with 138088074002521, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138088074007519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69044037001259 + 69044037001260.
It is an arithmetic number, because the mean of its divisors is an integer number (69044037001260).
Almost surely, 2138088074002519 is an apocalyptic number.
138088074002519 is a deficient number, since it is larger than the sum of its proper divisors (1).
138088074002519 is an equidigital number, since it uses as much as digits as its factorization.
138088074002519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3870720, while the sum is 56.
The spelling of 138088074002519 in words is "one hundred thirty-eight trillion, eighty-eight billion, seventy-four million, two thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •