Base | Representation |
---|---|
bin | 111110001011010… |
… | …000111100011101 |
3 | 2200200212000120221 |
4 | 332023100330131 |
5 | 4114020443011 |
6 | 251302041341 |
7 | 34564355413 |
oct | 7613207435 |
9 | 2620760527 |
10 | 1043140381 |
11 | 495909898 |
12 | 251419251 |
13 | 13816323a |
14 | 9c77b2b3 |
15 | 618a3971 |
hex | 3e2d0f1d |
1043140381 has 2 divisors, whose sum is σ = 1043140382. Its totient is φ = 1043140380.
The previous prime is 1043140369. The next prime is 1043140429. The reversal of 1043140381 is 1830413401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 796932900 + 246207481 = 28230^2 + 15691^2 .
It is a cyclic number.
It is not a de Polignac number, because 1043140381 - 227 = 908922653 is a prime.
It is a super-2 number, since 2×10431403812 = 2176283708945650322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1043140181) 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, 521570190 + 521570191.
It is an arithmetic number, because the mean of its divisors is an integer number (521570191).
Almost surely, 21043140381 is an apocalyptic number.
It is an amenable number.
1043140381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1043140381 is an equidigital number, since it uses as much as digits as its factorization.
1043140381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 1043140381 is about 32297.6838333649. The cubic root of 1043140381 is about 1014.1781568371.
Adding to 1043140381 its reverse (1830413401), we get a palindrome (2873553782).
The spelling of 1043140381 in words is "one billion, forty-three million, one hundred forty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •