Base | Representation |
---|---|
bin | 10101100110010010000… |
… | …10000001111001010101 |
3 | 2121221111201111002121021 |
4 | 22303021002001321111 |
5 | 44124313411034011 |
6 | 1324530323121141 |
7 | 104421051334564 |
oct | 12631102017125 |
9 | 2557451432537 |
10 | 742107127381 |
11 | 2667a9143724 |
12 | bb9aa2131b1 |
13 | 54c98c34529 |
14 | 27cbd695bdb |
15 | 14485a63471 |
hex | acc9081e55 |
742107127381 has 2 divisors, whose sum is σ = 742107127382. Its totient is φ = 742107127380.
The previous prime is 742107127379. The next prime is 742107127423. The reversal of 742107127381 is 183721701247.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 520086168900 + 222020958481 = 721170^2 + 471191^2 .
It is a cyclic number.
It is not a de Polignac number, because 742107127381 - 21 = 742107127379 is a prime.
It is a super-2 number, since 2×7421071273812 (a number of 25 digits) contains 22 as substring.
Together with 742107127379, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (742107127301) 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, 371053563690 + 371053563691.
It is an arithmetic number, because the mean of its divisors is an integer number (371053563691).
Almost surely, 2742107127381 is an apocalyptic number.
It is an amenable number.
742107127381 is a deficient number, since it is larger than the sum of its proper divisors (1).
742107127381 is an equidigital number, since it uses as much as digits as its factorization.
742107127381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131712, while the sum is 43.
The spelling of 742107127381 in words is "seven hundred forty-two billion, one hundred seven million, one hundred twenty-seven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •