Base | Representation |
---|---|
bin | 100101000101011110000000… |
… | …001110111001111010000101 |
3 | 210101111112201202022122201022 |
4 | 211011132000032321322011 |
5 | 132334242014310101303 |
6 | 1334520421311240525 |
7 | 46232561426662253 |
oct | 4505360016717205 |
9 | 711445652278638 |
10 | 163103534456453 |
11 | 47a73903111548 |
12 | 16362683819145 |
13 | 700179c3758c6 |
14 | 2c3c378a6d5d3 |
15 | 13cca6d267438 |
hex | 9457803b9e85 |
163103534456453 has 8 divisors (see below), whose sum is σ = 163836769913856. Its totient is φ = 162370582933600.
The previous prime is 163103534456353. The next prime is 163103534456507. The reversal of 163103534456453 is 354654435301361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163103534456453 - 216 = 163103534390917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 163103534456395 and 163103534456404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163103534456353) 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, 69832133 + ... + 72129978.
It is an arithmetic number, because the mean of its divisors is an integer number (20479596239232).
Almost surely, 2163103534456453 is an apocalyptic number.
It is an amenable number.
163103534456453 is a deficient number, since it is larger than the sum of its proper divisors (733235457403).
163103534456453 is a wasteful number, since it uses less digits than its factorization.
163103534456453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141967275.
The product of its (nonzero) digits is 23328000, while the sum is 53.
The spelling of 163103534456453 in words is "one hundred sixty-three trillion, one hundred three billion, five hundred thirty-four million, four hundred fifty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •