Base | Representation |
---|---|
bin | 111110000100010… |
… | …010111010011001 |
3 | 2200120102012111012 |
4 | 332010102322121 |
5 | 4113034012213 |
6 | 251154543305 |
7 | 34543006136 |
oct | 7604227231 |
9 | 2616365435 |
10 | 1041313433 |
11 | 494881216 |
12 | 250897b35 |
13 | 1379737c4 |
14 | 9c42358d |
15 | 616424a8 |
hex | 3e112e99 |
1041313433 has 2 divisors, whose sum is σ = 1041313434. Its totient is φ = 1041313432.
The previous prime is 1041313421. The next prime is 1041313447. The reversal of 1041313433 is 3343131401.
1041313433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1012066969 + 29246464 = 31813^2 + 5408^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041313433 - 218 = 1041051289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1041313399 and 1041313408.
It is not a weakly prime, because it can be changed into another prime (1041313463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520656716 + 520656717.
It is an arithmetic number, because the mean of its divisors is an integer number (520656717).
Almost surely, 21041313433 is an apocalyptic number.
It is an amenable number.
1041313433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1041313433 is an equidigital number, since it uses as much as digits as its factorization.
1041313433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 1041313433 is about 32269.3884819654. The cubic root of 1041313433 is about 1013.5857362539.
Adding to 1041313433 its reverse (3343131401), we get a palindrome (4384444834).
The spelling of 1041313433 in words is "one billion, forty-one million, three hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •