Base | Representation |
---|---|
bin | 1010000000100110000011… |
… | …0011000101000110000101 |
3 | 1102222002200101101200002221 |
4 | 2200021200303011012011 |
5 | 2420302404013342201 |
6 | 35223440124332341 |
7 | 2214052225233532 |
oct | 240114063050605 |
9 | 42862611350087 |
10 | 11005330215301 |
11 | 3563374aa8624 |
12 | 1298aa69a40b1 |
13 | 61aa4b7cc6c6 |
14 | 2a0937433d89 |
15 | 1414195dc4a1 |
hex | a0260cc5185 |
11005330215301 has 2 divisors, whose sum is σ = 11005330215302. Its totient is φ = 11005330215300.
The previous prime is 11005330215287. The next prime is 11005330215329. The reversal of 11005330215301 is 10351203350011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10977890624100 + 27439591201 = 3313290^2 + 165649^2 .
It is a cyclic number.
It is not a de Polignac number, because 11005330215301 - 221 = 11005328118149 is a prime.
It is a super-2 number, since 2×110053302153012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11005330215331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502665107650 + 5502665107651.
It is an arithmetic number, because the mean of its divisors is an integer number (5502665107651).
Almost surely, 211005330215301 is an apocalyptic number.
It is an amenable number.
11005330215301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11005330215301 is an equidigital number, since it uses as much as digits as its factorization.
11005330215301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 25.
Adding to 11005330215301 its reverse (10351203350011), we get a palindrome (21356533565312).
The spelling of 11005330215301 in words is "eleven trillion, five billion, three hundred thirty million, two hundred fifteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •