Base | Representation |
---|---|
bin | 1001100001001000100… |
… | …0101011011010111100 |
3 | 120122001111121011102001 |
4 | 2120102020223122330 |
5 | 10134333313202030 |
6 | 203041123312044 |
7 | 14546001520156 |
oct | 2302210533274 |
9 | 518044534361 |
10 | 163513022140 |
11 | 63388924746 |
12 | 2783421b624 |
13 | 1255b015550 |
14 | 7cb2301ad6 |
15 | 43c00bccca |
hex | 261222b6bc |
163513022140 has 24 divisors (see below), whose sum is σ = 369790989120. Its totient is φ = 60374038848.
The previous prime is 163513022129. The next prime is 163513022161. The reversal of 163513022140 is 41220315361.
It is a super-2 number, since 2×1635130221402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 163513022099 and 163513022108.
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 7 ways as a sum of consecutive naturals, for example, 314447860 + ... + 314448379.
It is an arithmetic number, because the mean of its divisors is an integer number (15407957880).
Almost surely, 2163513022140 is an apocalyptic number.
163513022140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
163513022140 is an abundant number, since it is smaller than the sum of its proper divisors (206277966980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163513022140 is a wasteful number, since it uses less digits than its factorization.
163513022140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628896261 (or 628896259 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The spelling of 163513022140 in words is "one hundred sixty-three billion, five hundred thirteen million, twenty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •