Base | Representation |
---|---|
bin | 11101001100010011000… |
… | …00101010001101001001 |
3 | 10112220000012012221020111 |
4 | 32212021200222031021 |
5 | 112413203302420131 |
6 | 2044442044354321 |
7 | 132316061616463 |
oct | 16461140521511 |
9 | 3486005187214 |
10 | 1003034420041 |
11 | 357425865655 |
12 | 14248a2459a1 |
13 | 7377cb41b64 |
14 | 3679344d133 |
15 | 1b157d58ab1 |
hex | e98982a349 |
1003034420041 has 2 divisors, whose sum is σ = 1003034420042. Its totient is φ = 1003034420040.
The previous prime is 1003034420021. The next prime is 1003034420081. The reversal of 1003034420041 is 1400244303001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 709157673225 + 293876746816 = 842115^2 + 542104^2 .
It is a cyclic number.
It is not a de Polignac number, because 1003034420041 - 29 = 1003034419529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1003034419994 and 1003034420021.
It is not a weakly prime, because it can be changed into another prime (1003034420021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501517210020 + 501517210021.
It is an arithmetic number, because the mean of its divisors is an integer number (501517210021).
Almost surely, 21003034420041 is an apocalyptic number.
It is an amenable number.
1003034420041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003034420041 is an equidigital number, since it uses as much as digits as its factorization.
1003034420041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 1003034420041 its reverse (1400244303001), we get a palindrome (2403278723042).
The spelling of 1003034420041 in words is "one trillion, three billion, thirty-four million, four hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •