Base | Representation |
---|---|
bin | 11110100011111000011… |
… | …011011000110001001001 |
3 | 21102202202102011211021212 |
4 | 132203320123120301021 |
5 | 233402012131004403 |
6 | 4244440023542505 |
7 | 304504506126566 |
oct | 36437033306111 |
9 | 7382672154255 |
10 | 2100111969353 |
11 | 73a71a503142 |
12 | 29b0232baa35 |
13 | 123069318668 |
14 | 7390873986d |
15 | 39966e834d8 |
hex | 1e8f86d8c49 |
2100111969353 has 2 divisors, whose sum is σ = 2100111969354. Its totient is φ = 2100111969352.
The previous prime is 2100111969343. The next prime is 2100111969359. The reversal of 2100111969353 is 3539691110012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2088363143689 + 11748825664 = 1445117^2 + 108392^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100111969353 - 26 = 2100111969289 is a prime.
It is a super-3 number, since 3×21001119693533 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2100111969353.
It is not a weakly prime, because it can be changed into another prime (2100111969359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050055984676 + 1050055984677.
It is an arithmetic number, because the mean of its divisors is an integer number (1050055984677).
Almost surely, 22100111969353 is an apocalyptic number.
It is an amenable number.
2100111969353 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100111969353 is an equidigital number, since it uses as much as digits as its factorization.
2100111969353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 41.
The spelling of 2100111969353 in words is "two trillion, one hundred billion, one hundred eleven million, nine hundred sixty-nine thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •