Base | Representation |
---|---|
bin | 1010001100100101111010… |
… | …0001001100011010000001 |
3 | 1110200210201020220002000211 |
4 | 2203021132201030122001 |
5 | 2432142022300334213 |
6 | 35502245203314121 |
7 | 2235000123016651 |
oct | 243113641143201 |
9 | 43623636802024 |
10 | 11211450402433 |
11 | 3632827519a16 |
12 | 1310a3007b941 |
13 | 634309a78788 |
14 | 2aa8cc28c361 |
15 | 14697eeda53d |
hex | a325e84c681 |
11211450402433 has 2 divisors, whose sum is σ = 11211450402434. Its totient is φ = 11211450402432.
The previous prime is 11211450402413. The next prime is 11211450402577. The reversal of 11211450402433 is 33420405411211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8254261158529 + 2957189243904 = 2873023^2 + 1719648^2 .
It is a cyclic number.
It is not a de Polignac number, because 11211450402433 - 217 = 11211450271361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11211450402395 and 11211450402404.
It is not a weakly prime, because it can be changed into another prime (11211450402413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605725201216 + 5605725201217.
It is an arithmetic number, because the mean of its divisors is an integer number (5605725201217).
Almost surely, 211211450402433 is an apocalyptic number.
It is an amenable number.
11211450402433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211450402433 is an equidigital number, since it uses as much as digits as its factorization.
11211450402433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 11211450402433 its reverse (33420405411211), we get a palindrome (44631855813644).
The spelling of 11211450402433 in words is "eleven trillion, two hundred eleven billion, four hundred fifty million, four hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •