Base | Representation |
---|---|
bin | 1010010010111110000011… |
… | …0001111001110011100001 |
3 | 1111002021111122121110012001 |
4 | 2210233200301321303201 |
5 | 2440440412030100134 |
6 | 40024444502004001 |
7 | 2245626116165356 |
oct | 244574061716341 |
9 | 44067448543161 |
10 | 11321010003169 |
11 | 3675239010599 |
12 | 132a107416601 |
13 | 641749c5a8a9 |
14 | 2b1d22b9262d |
15 | 1497435de414 |
hex | a4be0c79ce1 |
11321010003169 has 2 divisors, whose sum is σ = 11321010003170. Its totient is φ = 11321010003168.
The previous prime is 11321010003089. The next prime is 11321010003211. The reversal of 11321010003169 is 96130001012311.
11321010003169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11238418140625 + 82591862544 = 3352375^2 + 287388^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321010003169 - 211 = 11321010001121 is a prime.
It is a super-2 number, since 2×113210100031692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11321010004169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660505001584 + 5660505001585.
It is an arithmetic number, because the mean of its divisors is an integer number (5660505001585).
Almost surely, 211321010003169 is an apocalyptic number.
It is an amenable number.
11321010003169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321010003169 is an equidigital number, since it uses as much as digits as its factorization.
11321010003169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 28.
The spelling of 11321010003169 in words is "eleven trillion, three hundred twenty-one billion, ten million, three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •