Base | Representation |
---|---|
bin | 10101001111011111… |
… | …11101000010010001 |
3 | 1002102210012111011112 |
4 | 22213233331002101 |
5 | 141324000103213 |
6 | 5123345423105 |
7 | 552415645211 |
oct | 124757750221 |
9 | 32383174145 |
10 | 11404300433 |
11 | 4922480789 |
12 | 226333aa95 |
13 | 10c9913486 |
14 | 7a2874241 |
15 | 46b301ea8 |
hex | 2a7bfd091 |
11404300433 has 2 divisors, whose sum is σ = 11404300434. Its totient is φ = 11404300432.
The previous prime is 11404300357. The next prime is 11404300447. The reversal of 11404300433 is 33400340411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8539053649 + 2865246784 = 92407^2 + 53528^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11404300433 is a prime.
It is a super-2 number, since 2×114043004332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11404300399 and 11404300408.
It is not a weakly prime, because it can be changed into another prime (11404300463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5702150216 + 5702150217.
It is an arithmetic number, because the mean of its divisors is an integer number (5702150217).
Almost surely, 211404300433 is an apocalyptic number.
It is an amenable number.
11404300433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11404300433 is an equidigital number, since it uses as much as digits as its factorization.
11404300433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 11404300433 its reverse (33400340411), we get a palindrome (44804640844).
The spelling of 11404300433 in words is "eleven billion, four hundred four million, three hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •