Base | Representation |
---|---|
bin | 100100100111110000101111… |
… | …000011110111100010000100 |
3 | 210010021101100002212210200112 |
4 | 210213300233003313202010 |
5 | 132102320101131034134 |
6 | 1330314520152132152 |
7 | 45632231033064020 |
oct | 4447605703674204 |
9 | 703241302783615 |
10 | 161062063143044 |
11 | 47357045846128 |
12 | 16092aa7097058 |
13 | 6bb4119ca1c3b |
14 | 2bab634459380 |
15 | 13948d95231ce |
hex | 927c2f0f7884 |
161062063143044 has 48 divisors (see below), whose sum is σ = 323908908750336. Its totient is φ = 68644157097600.
The previous prime is 161062063143013. The next prime is 161062063143071. The reversal of 161062063143044 is 440341360260161.
It is a junction number, because it is equal to n+sod(n) for n = 161062063142992 and 161062063143010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 379031162 + ... + 379455854.
It is an arithmetic number, because the mean of its divisors is an integer number (6748102265632).
Almost surely, 2161062063143044 is an apocalyptic number.
161062063143044 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
161062063143044 is an abundant number, since it is smaller than the sum of its proper divisors (162846845607292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161062063143044 is a wasteful number, since it uses less digits than its factorization.
161062063143044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499716 (or 499714 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 161062063143044 in words is "one hundred sixty-one trillion, sixty-two billion, sixty-three million, one hundred forty-three thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •