Base | Representation |
---|---|
bin | 11101111100111101… |
… | …000110111101011010 |
3 | 10002000100220110121200 |
4 | 131330331012331122 |
5 | 1011331224241041 |
6 | 22435153215030 |
7 | 2215661251605 |
oct | 357475067532 |
9 | 102010813550 |
10 | 32161165146 |
11 | 12704159430 |
12 | 6296861476 |
13 | 305704a346 |
14 | 17b149733c |
15 | c837241b6 |
hex | 77cf46f5a |
32161165146 has 96 divisors (see below), whose sum is σ = 77445987840. Its totient is φ = 9563248800.
The previous prime is 32161165103. The next prime is 32161165151. The reversal of 32161165146 is 64156116123.
32161165146 is a `hidden beast` number, since 3 + 21 + 6 + 116 + 514 + 6 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 32161165146.
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 47 ways as a sum of consecutive naturals, for example, 7369161 + ... + 7373523.
It is an arithmetic number, because the mean of its divisors is an integer number (806729040).
Almost surely, 232161165146 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32161165146, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38722993920).
32161165146 is an abundant number, since it is smaller than the sum of its proper divisors (45284822694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32161165146 is a wasteful number, since it uses less digits than its factorization.
32161165146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5072 (or 5069 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The spelling of 32161165146 in words is "thirty-two billion, one hundred sixty-one million, one hundred sixty-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •