Base | Representation |
---|---|
bin | 100101000101011110000000… |
… | …001110111100000010000000 |
3 | 210101111112201202100002122111 |
4 | 211011132000032330002000 |
5 | 132334242014310341102 |
6 | 1334520421311345104 |
7 | 46232561430026521 |
oct | 4505360016740200 |
9 | 711445652302574 |
10 | 163103534465152 |
11 | 47a73903118036 |
12 | 16362683822194 |
13 | 700179c379858 |
14 | 2c3c378a72848 |
15 | 13cca6d269cd7 |
hex | 9457803bc080 |
163103534465152 has 64 divisors (see below), whose sum is σ = 339106095936000. Its totient is φ = 77995510585344.
The previous prime is 163103534465149. The next prime is 163103534465233. The reversal of 163103534465152 is 251564435301361.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 163103534465096 and 163103534465105.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 18100849 + ... + 25570447.
It is an arithmetic number, because the mean of its divisors is an integer number (5298532749000).
Almost surely, 2163103534465152 is an apocalyptic number.
It is an amenable number.
163103534465152 is an abundant number, since it is smaller than the sum of its proper divisors (176002561470848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163103534465152 is an equidigital number, since it uses as much as digits as its factorization.
163103534465152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7477053 (or 7477041 counting only the distinct ones).
The product of its (nonzero) digits is 3888000, while the sum is 49.
The spelling of 163103534465152 in words is "one hundred sixty-three trillion, one hundred three billion, five hundred thirty-four million, four hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •