Base | Representation |
---|---|
bin | 1001011111010000110… |
… | …1110001010100000001 |
3 | 120120202112000212001221 |
4 | 2113310031301110001 |
5 | 10132321311244023 |
6 | 202515232155041 |
7 | 14530364660656 |
oct | 2276415612401 |
9 | 516675025057 |
10 | 163011040513 |
11 | 631505344a2 |
12 | 27714098a81 |
13 | 124ab0184b9 |
14 | 7c65791c2d |
15 | 4390eb285d |
hex | 25f4371501 |
163011040513 has 4 divisors (see below), whose sum is σ = 163049700420. Its totient is φ = 162972380608.
The previous prime is 163011040501. The next prime is 163011040571. The reversal of 163011040513 is 315040110361.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 154298124864 + 8712915649 = 392808^2 + 93343^2 .
It is a cyclic number.
It is not a de Polignac number, because 163011040513 - 29 = 163011040001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (163011040573) 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, 19323628 + ... + 19332061.
It is an arithmetic number, because the mean of its divisors is an integer number (40762425105).
Almost surely, 2163011040513 is an apocalyptic number.
It is an amenable number.
163011040513 is a deficient number, since it is larger than the sum of its proper divisors (38659907).
163011040513 is an equidigital number, since it uses as much as digits as its factorization.
163011040513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38659906.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 163011040513 its reverse (315040110361), we get a palindrome (478051150874).
The spelling of 163011040513 in words is "one hundred sixty-three billion, eleven million, forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •