Base | Representation |
---|---|
bin | 101010000100010… |
… | …0100000101111101 |
3 | 10122101001012200212 |
4 | 1110020210011331 |
5 | 10342322444013 |
6 | 352022002205 |
7 | 46656550055 |
oct | 12410440575 |
9 | 3571035625 |
10 | 1411531133 |
11 | 664855261 |
12 | 334876365 |
13 | 19658822c |
14 | d5674565 |
15 | 83dc16a8 |
hex | 5422417d |
1411531133 has 2 divisors, whose sum is σ = 1411531134. Its totient is φ = 1411531132.
The previous prime is 1411531103. The next prime is 1411531141. The reversal of 1411531133 is 3311351141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1157224324 + 254306809 = 34018^2 + 15947^2 .
It is a cyclic number.
It is not a de Polignac number, because 1411531133 - 212 = 1411527037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1411531099 and 1411531108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1411531103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705765566 + 705765567.
It is an arithmetic number, because the mean of its divisors is an integer number (705765567).
Almost surely, 21411531133 is an apocalyptic number.
It is an amenable number.
1411531133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1411531133 is an equidigital number, since it uses as much as digits as its factorization.
1411531133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 540, while the sum is 23.
The square root of 1411531133 is about 37570.3491200175. The cubic root of 1411531133 is about 1121.7519172682.
Adding to 1411531133 its reverse (3311351141), we get a palindrome (4722882274).
The spelling of 1411531133 in words is "one billion, four hundred eleven million, five hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •