Base | Representation |
---|---|
bin | 1010000001100000111010… |
… | …0111000101111000111101 |
3 | 1110000121110120202101100222 |
4 | 2200120032213011320331 |
5 | 2421032234042212201 |
6 | 35235012054431125 |
7 | 2215151622412412 |
oct | 240301647057075 |
9 | 43017416671328 |
10 | 11021131210301 |
11 | 356a04327aa83 |
12 | 129bb766624a5 |
13 | 61c3992894a4 |
14 | 2a15d5ba2109 |
15 | 141a418c391b |
hex | a060e9c5e3d |
11021131210301 has 2 divisors, whose sum is σ = 11021131210302. Its totient is φ = 11021131210300.
The previous prime is 11021131210289. The next prime is 11021131210333. The reversal of 11021131210301 is 10301213112011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10927586376100 + 93544834201 = 3305690^2 + 305851^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11021131210301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11021131210301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021131200301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510565605150 + 5510565605151.
It is an arithmetic number, because the mean of its divisors is an integer number (5510565605151).
Almost surely, 211021131210301 is an apocalyptic number.
It is an amenable number.
11021131210301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021131210301 is an equidigital number, since it uses as much as digits as its factorization.
11021131210301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 11021131210301 its reverse (10301213112011), we get a palindrome (21322344322312).
The spelling of 11021131210301 in words is "eleven trillion, twenty-one billion, one hundred thirty-one million, two hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •