Base | Representation |
---|---|
bin | 1001011110011101110… |
… | …1011001111000000000 |
3 | 120120012121100020201010 |
4 | 2113213131121320000 |
5 | 10131402020110013 |
6 | 202442105240520 |
7 | 14522155652136 |
oct | 2274735317000 |
9 | 516177306633 |
10 | 162797035008 |
11 | 63050755a43 |
12 | 27674493140 |
13 | 1247589941a |
14 | 7c451a5756 |
15 | 437c2dd7c3 |
hex | 25e7759e00 |
162797035008 has 160 divisors (see below), whose sum is σ = 437458108032. Its totient is φ = 53797478400.
The previous prime is 162797034997. The next prime is 162797035039. The reversal of 162797035008 is 800530797261.
162797035008 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173003818 + ... + 173004758.
Almost surely, 2162797035008 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 162797035008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218729054016).
162797035008 is an abundant number, since it is smaller than the sum of its proper divisors (274661073024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
162797035008 is an equidigital number, since it uses as much as digits as its factorization.
162797035008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1816 (or 1800 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 48.
The spelling of 162797035008 in words is "one hundred sixty-two billion, seven hundred ninety-seven million, thirty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •