Base | Representation |
---|---|
bin | 1001100010101001001… |
… | …1010010010010011101 |
3 | 120200002202111100001122 |
4 | 2120222103102102131 |
5 | 10141201111042330 |
6 | 203145245220325 |
7 | 14562023613035 |
oct | 2305223222235 |
9 | 520082440048 |
10 | 163918455965 |
11 | 63576771120 |
12 | 27927b616a5 |
13 | 125c400a214 |
14 | 7d100bc8c5 |
15 | 43e59a65e5 |
hex | 262a4d249d |
163918455965 has 32 divisors (see below), whose sum is σ = 216575565696. Its totient is φ = 118107996160.
The previous prime is 163918455959. The next prime is 163918455977. The reversal of 163918455965 is 569554819361.
It is a de Polignac number, because none of the positive numbers 2k-163918455965 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 163918455898 and 163918455907.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20648477 + ... + 20656413.
It is an arithmetic number, because the mean of its divisors is an integer number (6767986428).
Almost surely, 2163918455965 is an apocalyptic number.
It is an amenable number.
163918455965 is a deficient number, since it is larger than the sum of its proper divisors (52657109731).
163918455965 is a wasteful number, since it uses less digits than its factorization.
163918455965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11389.
The product of its digits is 34992000, while the sum is 62.
The spelling of 163918455965 in words is "one hundred sixty-three billion, nine hundred eighteen million, four hundred fifty-five thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •