Base | Representation |
---|---|
bin | 100010010011010… |
… | …1110000111010001 |
3 | 2222012210220121012 |
4 | 1010212232013101 |
5 | 4324124013131 |
6 | 310113540305 |
7 | 40344230111 |
oct | 10446560721 |
9 | 2865726535 |
10 | 1151001041 |
11 | 54078a133 |
12 | 281574695 |
13 | 1545c9908 |
14 | acc17041 |
15 | 6b0ac52b |
hex | 449ae1d1 |
1151001041 has 2 divisors, whose sum is σ = 1151001042. Its totient is φ = 1151001040.
The previous prime is 1151000999. The next prime is 1151001043. The reversal of 1151001041 is 1401001511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1030089025 + 120912016 = 32095^2 + 10996^2 .
It is a cyclic number.
It is not a de Polignac number, because 1151001041 - 214 = 1150984657 is a prime.
It is a super-3 number, since 3×11510010413 (a number of 28 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 1151001043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1151001043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575500520 + 575500521.
It is an arithmetic number, because the mean of its divisors is an integer number (575500521).
Almost surely, 21151001041 is an apocalyptic number.
It is an amenable number.
1151001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151001041 is an equidigital number, since it uses as much as digits as its factorization.
1151001041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20, while the sum is 14.
The square root of 1151001041 is about 33926.4062494099. The cubic root of 1151001041 is about 1047.9934592686.
Adding to 1151001041 its reverse (1401001511), we get a palindrome (2552002552).
The spelling of 1151001041 in words is "one billion, one hundred fifty-one million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •