Base | Representation |
---|---|
bin | 1100000001111100100… |
… | …11010100001000111001 |
3 | 1110111221220201221102001 |
4 | 12000332103110020321 |
5 | 23233031200023113 |
6 | 513521304341001 |
7 | 41602332653644 |
oct | 6007623241071 |
9 | 1414856657361 |
10 | 413362111033 |
11 | 14a340154173 |
12 | 68142174761 |
13 | 2cc97a46911 |
14 | 16014a6ca5b |
15 | ab44a277dd |
hex | 603e4d4239 |
413362111033 has 2 divisors, whose sum is σ = 413362111034. Its totient is φ = 413362111032.
The previous prime is 413362111009. The next prime is 413362111067. The reversal of 413362111033 is 330111263314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 393244376464 + 20117734569 = 627092^2 + 141837^2 .
It is a cyclic number.
It is not a de Polignac number, because 413362111033 - 225 = 413328556601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 413362110992 and 413362111010.
It is not a weakly prime, because it can be changed into another prime (413362111073) 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, 206681055516 + 206681055517.
It is an arithmetic number, because the mean of its divisors is an integer number (206681055517).
Almost surely, 2413362111033 is an apocalyptic number.
It is an amenable number.
413362111033 is a deficient number, since it is larger than the sum of its proper divisors (1).
413362111033 is an equidigital number, since it uses as much as digits as its factorization.
413362111033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 413362111033 its reverse (330111263314), we get a palindrome (743473374347).
The spelling of 413362111033 in words is "four hundred thirteen billion, three hundred sixty-two million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •