Base | Representation |
---|---|
bin | 110001001101000100100100… |
… | …100010011101101010110001 |
3 | 1001101012212210002211221100211 |
4 | 301031010210202131222301 |
5 | 211331014400244120103 |
6 | 2044125542103344121 |
7 | 63403365452640604 |
oct | 6115044442355261 |
9 | 1041185702757324 |
10 | 216402540223153 |
11 | 62a52890398399 |
12 | 20330318a52041 |
13 | 9399897458c3b |
14 | 3b61d2022633b |
15 | 1a041d788736d |
hex | c4d12489dab1 |
216402540223153 has 16 divisors (see below), whose sum is σ = 220072028616000. Its totient is φ = 212763926456640.
The previous prime is 216402540223127. The next prime is 216402540223193. The reversal of 216402540223153 is 351322045204612.
It is a cyclic number.
It is not a de Polignac number, because 216402540223153 - 221 = 216402538126001 is a prime.
It is a super-2 number, since 2×2164025402231532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (216402540223123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 185660023 + ... + 186821971.
It is an arithmetic number, because the mean of its divisors is an integer number (13754501788500).
Almost surely, 2216402540223153 is an apocalyptic number.
It is an amenable number.
216402540223153 is a deficient number, since it is larger than the sum of its proper divisors (3669488392847).
216402540223153 is a wasteful number, since it uses less digits than its factorization.
216402540223153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1175232.
The product of its (nonzero) digits is 345600, while the sum is 40.
Adding to 216402540223153 its reverse (351322045204612), we get a palindrome (567724585427765).
The spelling of 216402540223153 in words is "two hundred sixteen trillion, four hundred two billion, five hundred forty million, two hundred twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •