Base | Representation |
---|---|
bin | 100101000101101111110110… |
… | …111100100110010000010000 |
3 | 210101120101012211222202021110 |
4 | 211011233312330212100100 |
5 | 132340100300214441443 |
6 | 1334533311524253320 |
7 | 46234140502355550 |
oct | 4505576674462020 |
9 | 711511184882243 |
10 | 163122706015248 |
11 | 47a80a50a44411 |
12 | 16366334241240 |
13 | 7003536220035 |
14 | 2c3d276d05160 |
15 | 13cd2e13de233 |
hex | 945bf6f26410 |
163122706015248 has 80 divisors (see below), whose sum is σ = 481919101203456. Its totient is φ = 46575642491520.
The previous prime is 163122706015223. The next prime is 163122706015259. The reversal of 163122706015248 is 842510607221361.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 163122706015197 and 163122706015206.
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, 160142286 + ... + 161157677.
Almost surely, 2163122706015248 is an apocalyptic number.
It is an amenable number.
163122706015248 is an abundant number, since it is smaller than the sum of its proper divisors (318796395188208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163122706015248 is a wasteful number, since it uses less digits than its factorization.
163122706015248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321301492 (or 321301486 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 163122706015248 in words is "one hundred sixty-three trillion, one hundred twenty-two billion, seven hundred six million, fifteen thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •