Base | Representation |
---|---|
bin | 1010000001100001101010… |
… | …0101011011111111010001 |
3 | 1110000121222120202210111210 |
4 | 2200120122211123333101 |
5 | 2421033142004244441 |
6 | 35235044032330333 |
7 | 2215156612105644 |
oct | 240303245337721 |
9 | 43017876683453 |
10 | 11021332103121 |
11 | 356a1367127aa |
12 | 12a00119a39a9 |
13 | 61c3cba96c92 |
14 | 2a1614737a5b |
15 | 141a54357616 |
hex | a061a95bfd1 |
11021332103121 has 32 divisors (see below), whose sum is σ = 15070472606592. Its totient is φ = 7162061276160.
The previous prime is 11021332103071. The next prime is 11021332103137. The reversal of 11021332103121 is 12130123312011.
11021332103121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11021332103121 - 219 = 11021331578833 is a prime.
It is a super-2 number, since 2×110213321031212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11021332103141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 149948046 + ... + 150021528.
It is an arithmetic number, because the mean of its divisors is an integer number (470952268956).
Almost surely, 211021332103121 is an apocalyptic number.
It is an amenable number.
11021332103121 is a deficient number, since it is larger than the sum of its proper divisors (4049140503471).
11021332103121 is a wasteful number, since it uses less digits than its factorization.
11021332103121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80913.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11021332103121 its reverse (12130123312011), we get a palindrome (23151455415132).
The spelling of 11021332103121 in words is "eleven trillion, twenty-one billion, three hundred thirty-two million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •