Base | Representation |
---|---|
bin | 10011110100100100… |
… | …11111101001011001 |
3 | 1000110122001110012102 |
4 | 21322102133221121 |
5 | 133243222300121 |
6 | 4515542253145 |
7 | 524465064050 |
oct | 117222375131 |
9 | 30418043172 |
10 | 10641603161 |
11 | 45709a8a62 |
12 | 208ba271b5 |
13 | 10078c1507 |
14 | 72d459397 |
15 | 42439790b |
hex | 27a49fa59 |
10641603161 has 16 divisors (see below), whose sum is σ = 12249466368. Its totient is φ = 9055800000.
The previous prime is 10641603109. The next prime is 10641603187. The reversal of 10641603161 is 16130614601.
It is a cyclic number.
It is not a de Polignac number, because 10641603161 - 26 = 10641603097 is a prime.
It is a super-2 number, since 2×106416031612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10641603761) by changing a digit.
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, 903611 + ... + 915311.
It is an arithmetic number, because the mean of its divisors is an integer number (765591648).
Almost surely, 210641603161 is an apocalyptic number.
It is an amenable number.
10641603161 is a deficient number, since it is larger than the sum of its proper divisors (1607863207).
10641603161 is a wasteful number, since it uses less digits than its factorization.
10641603161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12632.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 10641603161 in words is "ten billion, six hundred forty-one million, six hundred three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •