Base | Representation |
---|---|
bin | 10011011111011… |
… | …10100111010001 |
3 | 102101122222221112 |
4 | 21233232213101 |
5 | 313324203031 |
6 | 24120303105 |
7 | 4023532514 |
oct | 1157564721 |
9 | 371588845 |
10 | 163506641 |
11 | 84327a61 |
12 | 46911a95 |
13 | 27b4a8bc |
14 | 17a02d7b |
15 | e54b62b |
hex | 9bee9d1 |
163506641 has 8 divisors (see below), whose sum is σ = 168560160. Its totient is φ = 158529312.
The previous prime is 163506631. The next prime is 163506653. The reversal of 163506641 is 146605361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163506641 - 222 = 159312337 is a prime.
It is a super-2 number, since 2×1635066412 = 53468843302205762, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 163506598 and 163506607.
It is not an unprimeable number, because it can be changed into a prime (163506631) by changing a digit.
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, 14675 + ... + 23288.
It is an arithmetic number, because the mean of its divisors is an integer number (21070020).
Almost surely, 2163506641 is an apocalyptic number.
It is an amenable number.
163506641 is a deficient number, since it is larger than the sum of its proper divisors (5053519).
163506641 is an equidigital number, since it uses as much as digits as its factorization.
163506641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38095.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 163506641 is about 12786.9715335571. The cubic root of 163506641 is about 546.8209338485.
The spelling of 163506641 in words is "one hundred sixty-three million, five hundred six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •