Base | Representation |
---|---|
bin | 1010010011100100000010… |
… | …1111110011011100101001 |
3 | 1111010020211111200222121201 |
4 | 2210321000233303130221 |
5 | 2441122304230001134 |
6 | 40033252551204201 |
7 | 2246436642553063 |
oct | 244710057633451 |
9 | 44106744628551 |
10 | 11331210000169 |
11 | 36795a2706284 |
12 | 1330093376661 |
13 | 6426b4200b87 |
14 | 2b260d6d6733 |
15 | 149b3dd05914 |
hex | a4e40bf3729 |
11331210000169 has 2 divisors, whose sum is σ = 11331210000170. Its totient is φ = 11331210000168.
The previous prime is 11331210000107. The next prime is 11331210000283. The reversal of 11331210000169 is 96100001213311.
11331210000169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8906571734544 + 2424638265625 = 2984388^2 + 1557125^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331210000169 - 29 = 11331209999657 is a prime.
It is a super-2 number, since 2×113312100001692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11331210600169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665605000084 + 5665605000085.
It is an arithmetic number, because the mean of its divisors is an integer number (5665605000085).
Almost surely, 211331210000169 is an apocalyptic number.
It is an amenable number.
11331210000169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331210000169 is an equidigital number, since it uses as much as digits as its factorization.
11331210000169 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 11331210000169 in words is "eleven trillion, three hundred thirty-one billion, two hundred ten million, one hundred sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •