Base | Representation |
---|---|
bin | 10011011111000… |
… | …11011011001101 |
3 | 102101120200002012 |
4 | 21233203123031 |
5 | 313321221223 |
6 | 24115311005 |
7 | 4023252065 |
oct | 1157433315 |
9 | 371520065 |
10 | 163460813 |
11 | 842a658a |
12 | 468ab465 |
13 | 27b32a99 |
14 | 179d03a5 |
15 | e53cc78 |
hex | 9be36cd |
163460813 has 4 divisors (see below), whose sum is σ = 163602528. Its totient is φ = 163319100.
The previous prime is 163460779. The next prime is 163460827. The reversal of 163460813 is 318064361.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 163460813 - 210 = 163459789 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 163460813.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163460873) 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 3 ways as a sum of consecutive naturals, for example, 69113 + ... + 71438.
It is an arithmetic number, because the mean of its divisors is an integer number (40900632).
Almost surely, 2163460813 is an apocalyptic number.
It is an amenable number.
163460813 is a deficient number, since it is larger than the sum of its proper divisors (141715).
163460813 is a wasteful number, since it uses less digits than its factorization.
163460813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141714.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 163460813 is about 12785.1794277593. The cubic root of 163460813 is about 546.7698410178.
The spelling of 163460813 in words is "one hundred sixty-three million, four hundred sixty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •