Base | Representation |
---|---|
bin | 1010010010100000101100… |
… | …1001111011111111000001 |
3 | 1111001112011112220020020112 |
4 | 2210220023021323333001 |
5 | 2440323243014341113 |
6 | 40021103003521105 |
7 | 2245226634650624 |
oct | 244501311737701 |
9 | 44045145806215 |
10 | 11313131012033 |
11 | 3671965583974 |
12 | 1328688829195 |
13 | 640a92805966 |
14 | 2b17b65c7dbb |
15 | 149431a485a8 |
hex | a4a0b27bfc1 |
11313131012033 has 2 divisors, whose sum is σ = 11313131012034. Its totient is φ = 11313131012032.
The previous prime is 11313131011961. The next prime is 11313131012047. The reversal of 11313131012033 is 33021013131311.
11313131012033 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., 11278662490384 + 34468521649 = 3358372^2 + 185657^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313131012033 - 228 = 11312862576577 is a prime.
It is not a weakly prime, because it can be changed into another prime (11313131012063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656565506016 + 5656565506017.
It is an arithmetic number, because the mean of its divisors is an integer number (5656565506017).
Almost surely, 211313131012033 is an apocalyptic number.
It is an amenable number.
11313131012033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313131012033 is an equidigital number, since it uses as much as digits as its factorization.
11313131012033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11313131012033 its reverse (33021013131311), we get a palindrome (44334144143344).
The spelling of 11313131012033 in words is "eleven trillion, three hundred thirteen billion, one hundred thirty-one million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •