Base | Representation |
---|---|
bin | 101001011011011… |
… | …1110000111110001 |
3 | 10120212210112020102 |
4 | 1102312332013301 |
5 | 10321334020222 |
6 | 345535322145 |
7 | 46310003642 |
oct | 12266760761 |
9 | 3525715212 |
10 | 1390141937 |
11 | 653776238 |
12 | 329680355 |
13 | 1920096c2 |
14 | d28a76c9 |
15 | 82098d92 |
hex | 52dbe1f1 |
1390141937 has 2 divisors, whose sum is σ = 1390141938. Its totient is φ = 1390141936.
The previous prime is 1390141903. The next prime is 1390141939. The reversal of 1390141937 is 7391410931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1366337296 + 23804641 = 36964^2 + 4879^2 .
It is a cyclic number.
It is not a de Polignac number, because 1390141937 - 218 = 1389879793 is a prime.
It is a super-2 number, since 2×13901419372 = 3864989210012223938, which contains 22 as substring.
Together with 1390141939, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1390141937.
It is not a weakly prime, because it can be changed into another prime (1390141939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 695070968 + 695070969.
It is an arithmetic number, because the mean of its divisors is an integer number (695070969).
Almost surely, 21390141937 is an apocalyptic number.
It is an amenable number.
1390141937 is a deficient number, since it is larger than the sum of its proper divisors (1).
1390141937 is an equidigital number, since it uses as much as digits as its factorization.
1390141937 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412, while the sum is 38.
The square root of 1390141937 is about 37284.6072394494. The cubic root of 1390141937 is about 1116.0570152930.
The spelling of 1390141937 in words is "one billion, three hundred ninety million, one hundred forty-one thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •