Base | Representation |
---|---|
bin | 111110011011010… |
… | …010100101000101 |
3 | 2200222202110021112 |
4 | 332123102211011 |
5 | 4121104411011 |
6 | 251532054405 |
7 | 34645153262 |
oct | 7633224505 |
9 | 2628673245 |
10 | 1047341381 |
11 | 498219099 |
12 | 252904405 |
13 | 138ca4438 |
14 | 9d152269 |
15 | 61e3358b |
hex | 3e6d2945 |
1047341381 has 2 divisors, whose sum is σ = 1047341382. Its totient is φ = 1047341380.
The previous prime is 1047341371. The next prime is 1047341419. The reversal of 1047341381 is 1831437401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 770950756 + 276390625 = 27766^2 + 16625^2 .
It is an emirp because it is prime and its reverse (1831437401) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1047341381 is a prime.
It is a super-2 number, since 2×10473413812 = 2193847936709974322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1047341371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 523670690 + 523670691.
It is an arithmetic number, because the mean of its divisors is an integer number (523670691).
Almost surely, 21047341381 is an apocalyptic number.
It is an amenable number.
1047341381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1047341381 is an equidigital number, since it uses as much as digits as its factorization.
1047341381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 1047341381 is about 32362.6541093279. The cubic root of 1047341381 is about 1015.5377871128.
Adding to 1047341381 its reverse (1831437401), we get a palindrome (2878778782).
The spelling of 1047341381 in words is "one billion, forty-seven million, three hundred forty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •