Base | Representation |
---|---|
bin | 1001110111000101100… |
… | …1110110110100100101 |
3 | 121012021012220010101012 |
4 | 2131301121312310211 |
5 | 10233421004444401 |
6 | 205454005312005 |
7 | 15145022013203 |
oct | 2356131666445 |
9 | 535235803335 |
10 | 169406328101 |
11 | 6593250173a |
12 | 289b9a05605 |
13 | 12c89c6593a |
14 | 82b0c9a073 |
15 | 461767c8bb |
hex | 2771676d25 |
169406328101 has 8 divisors (see below), whose sum is σ = 173794552344. Its totient is φ = 165030311680.
The previous prime is 169406328097. The next prime is 169406328139. The reversal of 169406328101 is 101823604961.
It is a Cunningham number, because it is equal to 4115902+1.
It can be written as a sum of positive squares in 4 ways, for example, as 8163122500 + 161243205601 = 90350^2 + 401551^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 169406328101 - 22 = 169406328097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (169406328151) 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, 3023840 + ... + 3079353.
It is an arithmetic number, because the mean of its divisors is an integer number (21724319043).
Almost surely, 2169406328101 is an apocalyptic number.
It is an amenable number.
169406328101 is a deficient number, since it is larger than the sum of its proper divisors (4388224243).
169406328101 is an equidigital number, since it uses as much as digits as its factorization.
169406328101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6103911.
The product of its (nonzero) digits is 62208, while the sum is 41.
The spelling of 169406328101 in words is "one hundred sixty-nine billion, four hundred six million, three hundred twenty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •