Base | Representation |
---|---|
bin | 1000000100111100100… |
… | …1011110010011000011 |
3 | 111021011220021201000221 |
4 | 2001033021132103003 |
5 | 4233143302240211 |
6 | 143425410523511 |
7 | 13011525436462 |
oct | 2011711362303 |
9 | 437156251027 |
10 | 138766836931 |
11 | 5393a297508 |
12 | 22a88896597 |
13 | 10116258bc8 |
14 | 6a059489d9 |
15 | 3922834c71 |
hex | 204f25e4c3 |
138766836931 has 2 divisors, whose sum is σ = 138766836932. Its totient is φ = 138766836930.
The previous prime is 138766836917. The next prime is 138766836941. The reversal of 138766836931 is 139638667831.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 138766836931 - 29 = 138766836419 is a prime.
It is a super-2 number, since 2×1387668369312 (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 138766836931.
It is not a weakly prime, because it can be changed into another prime (138766836941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69383418465 + 69383418466.
It is an arithmetic number, because the mean of its divisors is an integer number (69383418466).
Almost surely, 2138766836931 is an apocalyptic number.
138766836931 is a deficient number, since it is larger than the sum of its proper divisors (1).
138766836931 is an equidigital number, since it uses as much as digits as its factorization.
138766836931 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23514624, while the sum is 61.
The spelling of 138766836931 in words is "one hundred thirty-eight billion, seven hundred sixty-six million, eight hundred thirty-six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •