Base | Representation |
---|---|
bin | 1000000110111001101… |
… | …0110000001110010101 |
3 | 111022112110110100021112 |
4 | 2001232122300032111 |
5 | 4240232103214001 |
6 | 143553431224405 |
7 | 13030525610324 |
oct | 2015632601625 |
9 | 438473410245 |
10 | 139291460501 |
11 | 54089441a06 |
12 | 22bb4518105 |
13 | 1019ab52a5b |
14 | 6a554b00bb |
15 | 3953913cbb |
hex | 206e6b0395 |
139291460501 has 2 divisors, whose sum is σ = 139291460502. Its totient is φ = 139291460500.
The previous prime is 139291460417. The next prime is 139291460507. The reversal of 139291460501 is 105064192931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135001865476 + 4289595025 = 367426^2 + 65495^2 .
It is a cyclic number.
It is not a de Polignac number, because 139291460501 - 210 = 139291459477 is a prime.
It is a super-2 number, since 2×1392914605012 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139291460507) 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, 69645730250 + 69645730251.
It is an arithmetic number, because the mean of its divisors is an integer number (69645730251).
Almost surely, 2139291460501 is an apocalyptic number.
It is an amenable number.
139291460501 is a deficient number, since it is larger than the sum of its proper divisors (1).
139291460501 is an equidigital number, since it uses as much as digits as its factorization.
139291460501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 41.
The spelling of 139291460501 in words is "one hundred thirty-nine billion, two hundred ninety-one million, four hundred sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •