Base | Representation |
---|---|
bin | 11101001100110011001… |
… | …10101011000110101001 |
3 | 10112220201000021222001221 |
4 | 32212121212223012221 |
5 | 112414231413311131 |
6 | 2044524531542041 |
7 | 132325550650462 |
oct | 16463146530651 |
9 | 3486630258057 |
10 | 1003304432041 |
11 | 35755421766a |
12 | 14254475a921 |
13 | 737c3a70282 |
14 | 367bb257d69 |
15 | 1b1718e2411 |
hex | e9999ab1a9 |
1003304432041 has 2 divisors, whose sum is σ = 1003304432042. Its totient is φ = 1003304432040.
The previous prime is 1003304432027. The next prime is 1003304432089. The reversal of 1003304432041 is 1402344033001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 572134908816 + 431169523225 = 756396^2 + 656635^2 .
It is a cyclic number.
It is not a de Polignac number, because 1003304432041 - 211 = 1003304429993 is a prime.
It is a super-2 number, since 2×10033044320412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1003304431997 and 1003304432015.
It is not a weakly prime, because it can be changed into another prime (1003304433041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501652216020 + 501652216021.
It is an arithmetic number, because the mean of its divisors is an integer number (501652216021).
Almost surely, 21003304432041 is an apocalyptic number.
It is an amenable number.
1003304432041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003304432041 is an equidigital number, since it uses as much as digits as its factorization.
1003304432041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 1003304432041 its reverse (1402344033001), we get a palindrome (2405648465042).
The spelling of 1003304432041 in words is "one trillion, three billion, three hundred four million, four hundred thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •