Base | Representation |
---|---|
bin | 1010000000100001101100… |
… | …1111101111010101011101 |
3 | 1102221222200001200102010001 |
4 | 2200020123033233111131 |
5 | 2420243011302320404 |
6 | 35223124242014301 |
7 | 2214011265640036 |
oct | 240103317572535 |
9 | 42858601612101 |
10 | 11004163323229 |
11 | 356292635530a |
12 | 1298820047391 |
13 | 61a8c3b2aa1b |
14 | 2a0866481a8d |
15 | 14139be417a4 |
hex | a021b3ef55d |
11004163323229 has 2 divisors, whose sum is σ = 11004163323230. Its totient is φ = 11004163323228.
The previous prime is 11004163323199. The next prime is 11004163323287. The reversal of 11004163323229 is 92232336140011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10441622822500 + 562540500729 = 3231350^2 + 750027^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11004163323229 is a prime.
It is a super-2 number, since 2×110041633232292 (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 (11004163323289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502081661614 + 5502081661615.
It is an arithmetic number, because the mean of its divisors is an integer number (5502081661615).
Almost surely, 211004163323229 is an apocalyptic number.
It is an amenable number.
11004163323229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11004163323229 is an equidigital number, since it uses as much as digits as its factorization.
11004163323229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
The spelling of 11004163323229 in words is "eleven trillion, four billion, one hundred sixty-three million, three hundred twenty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •