Base | Representation |
---|---|
bin | 110000000000110011001001… |
… | …100111110101001011100001 |
3 | 1000200122210211221110220222001 |
4 | 300000303021213311023201 |
5 | 210134131021112134101 |
6 | 2025034032331444001 |
7 | 62322614156646166 |
oct | 6000631147651341 |
9 | 1020583757426861 |
10 | 211161154802401 |
11 | 61311a40a20571 |
12 | 1b8245435b6601 |
13 | 90a9546c7a77b |
14 | 3a2037c1d606d |
15 | 1962bbd794901 |
hex | c00cc99f52e1 |
211161154802401 has 4 divisors (see below), whose sum is σ = 214053773361412. Its totient is φ = 208268536243392.
The previous prime is 211161154802399. The next prime is 211161154802441. The reversal of 211161154802401 is 104208451161112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 170240518140625 + 40920636661776 = 13047625^2 + 6396924^2 .
It is a cyclic number.
It is not a de Polignac number, because 211161154802401 - 21 = 211161154802399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211161154802441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1446309279396 + ... + 1446309279541.
It is an arithmetic number, because the mean of its divisors is an integer number (53513443340353).
Almost surely, 2211161154802401 is an apocalyptic number.
It is an amenable number.
211161154802401 is a deficient number, since it is larger than the sum of its proper divisors (2892618559011).
211161154802401 is an equidigital number, since it uses as much as digits as its factorization.
211161154802401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2892618559010.
The product of its (nonzero) digits is 15360, while the sum is 37.
The spelling of 211161154802401 in words is "two hundred eleven trillion, one hundred sixty-one billion, one hundred fifty-four million, eight hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •