Base | Representation |
---|---|
bin | 100010000000110… |
… | …1110010111001011 |
3 | 2221112120012000112 |
4 | 1010001232113023 |
5 | 4314133141411 |
6 | 305130024535 |
7 | 40165625132 |
oct | 10401562713 |
9 | 2845505015 |
10 | 1141302731 |
11 | 5362656a8 |
12 | 27a27814b |
13 | 1525b247a |
14 | ab810919 |
15 | 6a2e3b8b |
hex | 4406e5cb |
1141302731 has 2 divisors, whose sum is σ = 1141302732. Its totient is φ = 1141302730.
The previous prime is 1141302707. The next prime is 1141302733. The reversal of 1141302731 is 1372031411.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1372031411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1141302731 is a prime.
It is a super-2 number, since 2×11413027312 = 2605143847576116722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 1141302733, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1141302697 and 1141302706.
It is not a weakly prime, because it can be changed into another prime (1141302733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570651365 + 570651366.
It is an arithmetic number, because the mean of its divisors is an integer number (570651366).
Almost surely, 21141302731 is an apocalyptic number.
1141302731 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141302731 is an equidigital number, since it uses as much as digits as its factorization.
1141302731 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 1141302731 is about 33783.1723051581. The cubic root of 1141302731 is about 1045.0416964048.
The spelling of 1141302731 in words is "one billion, one hundred forty-one million, three hundred two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •