Base | Representation |
---|---|
bin | 100010000000110… |
… | …1110011011100101 |
3 | 2221112120012101222 |
4 | 1010001232123211 |
5 | 4314133144023 |
6 | 305130030125 |
7 | 40165626014 |
oct | 10401563345 |
9 | 2845505358 |
10 | 1141303013 |
11 | 536265934 |
12 | 27a278345 |
13 | 1525b2636 |
14 | ab810a7b |
15 | 6a2e3cc8 |
hex | 4406e6e5 |
1141303013 has 2 divisors, whose sum is σ = 1141303014. Its totient is φ = 1141303012.
The previous prime is 1141302983. The next prime is 1141303027. The reversal of 1141303013 is 3103031411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 920394244 + 220908769 = 30338^2 + 14863^2 .
It is an emirp because it is prime and its reverse (3103031411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1141303013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1141302982 and 1141303000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1141303043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570651506 + 570651507.
It is an arithmetic number, because the mean of its divisors is an integer number (570651507).
Almost surely, 21141303013 is an apocalyptic number.
It is an amenable number.
1141303013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141303013 is an equidigital number, since it uses as much as digits as its factorization.
1141303013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1141303013 is about 33783.1764788334. The cubic root of 1141303013 is about 1045.0417824766.
Adding to 1141303013 its reverse (3103031411), we get a palindrome (4244334424).
The spelling of 1141303013 in words is "one billion, one hundred forty-one million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •