Base | Representation |
---|---|
bin | 100101000101011011110101… |
… | …110100011010000110110000 |
3 | 210101111022201220200120200202 |
4 | 211011123311310122012300 |
5 | 132334222240314122030 |
6 | 1334515355034334332 |
7 | 46232450041411502 |
oct | 4505336564320660 |
9 | 711438656616622 |
10 | 163101212254640 |
11 | 47a729213069a0 |
12 | 16362135b8a3a8 |
13 | 70014bc2290aa |
14 | 2c3c1d84a1d72 |
15 | 13cc98445c745 |
hex | 9456f5d1a1b0 |
163101212254640 has 80 divisors (see below), whose sum is σ = 414329358072096. Its totient is φ = 59217004953600.
The previous prime is 163101212254633. The next prime is 163101212254661. The reversal of 163101212254640 is 46452212101361.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 163101212254594 and 163101212254603.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 144008687 + ... + 145136846.
Almost surely, 2163101212254640 is an apocalyptic number.
163101212254640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
163101212254640 is an abundant number, since it is smaller than the sum of its proper divisors (251228145817456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163101212254640 is a wasteful number, since it uses less digits than its factorization.
163101212254640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289146198 (or 289146192 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 163101212254640 in words is "one hundred sixty-three trillion, one hundred one billion, two hundred twelve million, two hundred fifty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •