Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1110011010011110101111 |
3 | 1110000121200212002211210022 |
4 | 2200120103332122132233 |
5 | 2421032430112210111 |
6 | 35235025031432355 |
7 | 2215154064404324 |
oct | 240302376323657 |
9 | 43017625084708 |
10 | 11021221210031 |
11 | 356a08a06111a |
12 | 129bba08256bb |
13 | 61c3b1b0b276 |
14 | 2a1603b0cb4b |
15 | 141a497502db |
hex | a0613f9a7af |
11021221210031 has 2 divisors, whose sum is σ = 11021221210032. Its totient is φ = 11021221210030.
The previous prime is 11021221209991. The next prime is 11021221210061. The reversal of 11021221210031 is 13001212212011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11021221210031 - 210 = 11021221209007 is a prime.
It is a super-3 number, since 3×110212212100313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11021221209991 and 11021221210009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021221210061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510610605015 + 5510610605016.
It is an arithmetic number, because the mean of its divisors is an integer number (5510610605016).
Almost surely, 211021221210031 is an apocalyptic number.
11021221210031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021221210031 is an equidigital number, since it uses as much as digits as its factorization.
11021221210031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11021221210031 its reverse (13001212212011), we get a palindrome (24022433422042).
The spelling of 11021221210031 in words is "eleven trillion, twenty-one billion, two hundred twenty-one million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •