Base | Representation |
---|---|
bin | 10101010010111101… |
… | …10001010100101001 |
3 | 1002111210212101021202 |
4 | 22221132301110221 |
5 | 141403414203231 |
6 | 5130304213545 |
7 | 553220606132 |
oct | 125136612451 |
9 | 32453771252 |
10 | 11433350441 |
11 | 4937912457 |
12 | 227100a2b5 |
13 | 1102944c26 |
14 | 7a6676c89 |
15 | 46db3e5cb |
hex | 2a97b1529 |
11433350441 has 2 divisors, whose sum is σ = 11433350442. Its totient is φ = 11433350440.
The previous prime is 11433350437. The next prime is 11433350471. The reversal of 11433350441 is 14405333411.
It is a happy number.
11433350441 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., 11397697600 + 35652841 = 106760^2 + 5971^2 .
It is a cyclic number.
It is not a de Polignac number, because 11433350441 - 22 = 11433350437 is a prime.
It is not a weakly prime, because it can be changed into another prime (11433350471) 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, 5716675220 + 5716675221.
It is an arithmetic number, because the mean of its divisors is an integer number (5716675221).
Almost surely, 211433350441 is an apocalyptic number.
It is an amenable number.
11433350441 is a deficient number, since it is larger than the sum of its proper divisors (1).
11433350441 is an equidigital number, since it uses as much as digits as its factorization.
11433350441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 11433350441 its reverse (14405333411), we get a palindrome (25838683852).
The spelling of 11433350441 in words is "eleven billion, four hundred thirty-three million, three hundred fifty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •