Base | Representation |
---|---|
bin | 1010010010011000110010… |
… | …1111110001010101110001 |
3 | 1111001022200202021000021002 |
4 | 2210212030233301111301 |
5 | 2440304422104122343 |
6 | 40020112324011345 |
7 | 2245123243361612 |
oct | 244461457612561 |
9 | 44038622230232 |
10 | 11311010223473 |
11 | 3670a77437054 |
12 | 1328196530b55 |
13 | 64081531979c |
14 | 2b1654a89c09 |
15 | 14935a7768b8 |
hex | a498cbf1571 |
11311010223473 has 2 divisors, whose sum is σ = 11311010223474. Its totient is φ = 11311010223472.
The previous prime is 11311010223377. The next prime is 11311010223493. The reversal of 11311010223473 is 37432201011311.
11311010223473 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11309419250704 + 1590972769 = 3362948^2 + 39887^2 .
It is a cyclic number.
It is not a de Polignac number, because 11311010223473 - 28 = 11311010223217 is a prime.
It is not a weakly prime, because it can be changed into another prime (11311010223493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655505111736 + 5655505111737.
It is an arithmetic number, because the mean of its divisors is an integer number (5655505111737).
Almost surely, 211311010223473 is an apocalyptic number.
It is an amenable number.
11311010223473 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311010223473 is an equidigital number, since it uses as much as digits as its factorization.
11311010223473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 29.
Adding to 11311010223473 its reverse (37432201011311), we get a palindrome (48743211234784).
The spelling of 11311010223473 in words is "eleven trillion, three hundred eleven billion, ten million, two hundred twenty-three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •