Base | Representation |
---|---|
bin | 100101000101011110011100… |
… | …000111011100111110101101 |
3 | 210101111120221100120210101222 |
4 | 211011132130013130332231 |
5 | 132334243444034440010 |
6 | 1334520535542113125 |
7 | 46232606140202504 |
oct | 4505363407347655 |
9 | 711446840523358 |
10 | 163104002265005 |
11 | 47a74023190a8a |
12 | 1636279441b7a5 |
13 | 70018452693b9 |
14 | 2c3c3c0c4583b |
15 | 13cca99372355 |
hex | 94579c1dcfad |
163104002265005 has 8 divisors (see below), whose sum is σ = 198933406041624. Its totient is φ = 128344132929600.
The previous prime is 163104002264939. The next prime is 163104002265011. The reversal of 163104002265005 is 500562200401361.
It can be written as a sum of positive squares in 4 ways, for example, as 20230438726276 + 142873563538729 = 4497826^2 + 11952973^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 163104002265005 - 212 = 163104002260909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 267383609966 + ... + 267383610575.
It is an arithmetic number, because the mean of its divisors is an integer number (24866675755203).
Almost surely, 2163104002265005 is an apocalyptic number.
It is an amenable number.
163104002265005 is a deficient number, since it is larger than the sum of its proper divisors (35829403776619).
163104002265005 is an equidigital number, since it uses as much as digits as its factorization.
163104002265005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534767220607.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 163104002265005 its reverse (500562200401361), we get a palindrome (663666202666366).
The spelling of 163104002265005 in words is "one hundred sixty-three trillion, one hundred four billion, two million, two hundred sixty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •