Base | Representation |
---|---|
bin | 1010010010010110010001… |
… | …0100100011111101010101 |
3 | 1111001020221111001210111012 |
4 | 2210211210110203331111 |
5 | 2440302024443032013 |
6 | 40015521135222005 |
7 | 2245100366525123 |
oct | 244454424437525 |
9 | 44036844053435 |
10 | 11310332002133 |
11 | 367075961234a |
12 | 1328027377905 |
13 | 640737964298 |
14 | 2b15cc980913 |
15 | 14931ae571a8 |
hex | a4964523f55 |
11310332002133 has 2 divisors, whose sum is σ = 11310332002134. Its totient is φ = 11310332002132.
The previous prime is 11310332002127. The next prime is 11310332002169. The reversal of 11310332002133 is 33120023301311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8081636923684 + 3228695078449 = 2842822^2 + 1796857^2 .
It is a cyclic number.
It is not a de Polignac number, because 11310332002133 - 214 = 11310331985749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11310332002099 and 11310332002108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11310332002033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655166001066 + 5655166001067.
It is an arithmetic number, because the mean of its divisors is an integer number (5655166001067).
Almost surely, 211310332002133 is an apocalyptic number.
It is an amenable number.
11310332002133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310332002133 is an equidigital number, since it uses as much as digits as its factorization.
11310332002133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11310332002133 its reverse (33120023301311), we get a palindrome (44430355303444).
The spelling of 11310332002133 in words is "eleven trillion, three hundred ten billion, three hundred thirty-two million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •