Base | Representation |
---|---|
bin | 1001011111011001011… |
… | …0100000101001001100 |
3 | 120120212000110222210020 |
4 | 2113312112200221030 |
5 | 10132410000322324 |
6 | 202522552342140 |
7 | 14531311443444 |
oct | 2276626405114 |
9 | 516760428706 |
10 | 163046885964 |
11 | 63169797736 |
12 | 277240a4950 |
13 | 124b5589021 |
14 | 7c6a443124 |
15 | 43941e3679 |
hex | 25f65a0a4c |
163046885964 has 72 divisors (see below), whose sum is σ = 404458775280. Its totient is φ = 51121205376.
The previous prime is 163046885957. The next prime is 163046885971. The reversal of 163046885964 is 469588640361.
It is an interprime number because it is at equal distance from previous prime (163046885957) and next prime (163046885971).
It is a junction number, because it is equal to n+sod(n) for n = 163046885898 and 163046885907.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 98042997 + ... + 98044659.
It is an arithmetic number, because the mean of its divisors is an integer number (5617482990).
Almost surely, 2163046885964 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 163046885964, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202229387640).
163046885964 is an abundant number, since it is smaller than the sum of its proper divisors (241411889316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163046885964 is an frugal number, since it uses more digits than its factorization.
163046885964 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3384 (or 1685 counting only the distinct ones).
The product of its (nonzero) digits is 29859840, while the sum is 60.
The spelling of 163046885964 in words is "one hundred sixty-three billion, forty-six million, eight hundred eighty-five thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •