Base | Representation |
---|---|
bin | 100101000101011110011100… |
… | …001110010001000000111011 |
3 | 210101111120221110221112100001 |
4 | 211011132130032101000323 |
5 | 132334244000014113003 |
6 | 1334520540044253431 |
7 | 46232606161321501 |
oct | 4505363416210073 |
9 | 711446843845301 |
10 | 163104004051003 |
11 | 47a740241a0914 |
12 | 16362794b41277 |
13 | 70018457432c2 |
14 | 2c3c3c118c671 |
15 | 13cca995c661d |
hex | 94579c39103b |
163104004051003 has 8 divisors (see below), whose sum is σ = 163446247996416. Its totient is φ = 162761831461800.
The previous prime is 163104004050989. The next prime is 163104004051057. The reversal of 163104004051003 is 300150400401361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-163104004051003 is a prime.
It is a super-2 number, since 2×1631040040510032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (163104004051103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13261483 + ... + 22407028.
It is an arithmetic number, because the mean of its divisors is an integer number (20430780999552).
Almost surely, 2163104004051003 is an apocalyptic number.
163104004051003 is a deficient number, since it is larger than the sum of its proper divisors (342243945413).
163104004051003 is an equidigital number, since it uses as much as digits as its factorization.
163104004051003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35678105.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 163104004051003 its reverse (300150400401361), we get a palindrome (463254404452364).
The spelling of 163104004051003 in words is "one hundred sixty-three trillion, one hundred four billion, four million, fifty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •