Base | Representation |
---|---|
bin | 1001011111100001110… |
… | …0011101110100110001 |
3 | 120120221110120001112112 |
4 | 2113320130131310301 |
5 | 10132442443023323 |
6 | 202530245135105 |
7 | 14532216066641 |
oct | 2277034356461 |
9 | 516843501475 |
10 | 163082001713 |
11 | 631875a1714 |
12 | 277339ba495 |
13 | 124bc932687 |
14 | 7c70d84521 |
15 | 439732d178 |
hex | 25f871dd31 |
163082001713 has 4 divisors (see below), whose sum is σ = 166874606448. Its totient is φ = 159289396980.
The previous prime is 163082001697. The next prime is 163082001721. The reversal of 163082001713 is 317100280361.
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, and also an emirpimes, since its reverse is a distinct semiprime: 317100280361 = 73 ⋅4343839457.
It is a cyclic number.
It is not a de Polignac number, because 163082001713 - 24 = 163082001697 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 163082001713.
It is not an unprimeable number, because it can be changed into a prime (163082001763) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1896302303 + ... + 1896302388.
It is an arithmetic number, because the mean of its divisors is an integer number (41718651612).
Almost surely, 2163082001713 is an apocalyptic number.
It is an amenable number.
163082001713 is a deficient number, since it is larger than the sum of its proper divisors (3792604735).
163082001713 is an equidigital number, since it uses as much as digits as its factorization.
163082001713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3792604734.
The product of its (nonzero) digits is 6048, while the sum is 32.
The spelling of 163082001713 in words is "one hundred sixty-three billion, eighty-two million, one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •