Base | Representation |
---|---|
bin | 10011011100100… |
… | …10001111000101 |
3 | 102100221202220110 |
4 | 21232102033011 |
5 | 313230101021 |
6 | 24104223233 |
7 | 4020365412 |
oct | 1156221705 |
9 | 370852813 |
10 | 163128261 |
11 | 8409974a |
12 | 4676ab19 |
13 | 27a475ca |
14 | 17945109 |
15 | e4c4476 |
hex | 9b923c5 |
163128261 has 8 divisors (see below), whose sum is σ = 217719040. Its totient is φ = 108644832.
The previous prime is 163128257. The next prime is 163128263. The reversal of 163128261 is 162821361.
163128261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 163128261 - 22 = 163128257 is a prime.
It is a super-2 number, since 2×1631282612 = 53221659073768242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163128263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23221 + ... + 29418.
It is an arithmetic number, because the mean of its divisors is an integer number (27214880).
Almost surely, 2163128261 is an apocalyptic number.
It is an amenable number.
163128261 is a deficient number, since it is larger than the sum of its proper divisors (54590779).
163128261 is a wasteful number, since it uses less digits than its factorization.
163128261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53675.
The product of its digits is 3456, while the sum is 30.
The square root of 163128261 is about 12772.1674354825. The cubic root of 163128261 is about 546.3987982631.
It can be divided in two parts, 1631 and 28261, that added together give a palindrome (29892).
The spelling of 163128261 in words is "one hundred sixty-three million, one hundred twenty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •