Base | Representation |
---|---|
bin | 1001011111010011101… |
… | …0100100011000001000 |
3 | 120120210100010111010012 |
4 | 2113310322210120020 |
5 | 10132332313042013 |
6 | 202520332011052 |
7 | 14530566541400 |
oct | 2276472443010 |
9 | 516710114105 |
10 | 163022784008 |
11 | 63157125567 |
12 | 27718000a88 |
13 | 124b059a806 |
14 | 7c6716b800 |
15 | 43920321a8 |
hex | 25f4ea4608 |
163022784008 has 36 divisors (see below), whose sum is σ = 355590090765. Its totient is φ = 69863481408.
The previous prime is 163022784007. The next prime is 163022784011. The reversal of 163022784008 is 800487220361.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 162762219844 + 260564164 = 403438^2 + 16142^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=285502.
It is not an unprimeable number, because it can be changed into a prime (163022784007) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 7983860 + ... + 8004252.
Almost surely, 2163022784008 is an apocalyptic number.
It is an amenable number.
163022784008 is an abundant number, since it is smaller than the sum of its proper divisors (192567306757).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163022784008 is an frugal number, since it uses more digits than its factorization.
163022784008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40806 (or 20402 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 41.
The spelling of 163022784008 in words is "one hundred sixty-three billion, twenty-two million, seven hundred eighty-four thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •