Base | Representation |
---|---|
bin | 100000000101101001… |
… | …1100011001111000001 |
3 | 20120212101201120121001 |
4 | 1000023103203033001 |
5 | 2112111220314134 |
6 | 51353442132001 |
7 | 4656430056235 |
oct | 1001323431701 |
9 | 216771646531 |
10 | 68909151169 |
11 | 27251468211 |
12 | 11431651001 |
13 | 666244c081 |
14 | 3499bba5c5 |
15 | 1bd4986414 |
hex | 100b4e33c1 |
68909151169 has 2 divisors, whose sum is σ = 68909151170. Its totient is φ = 68909151168.
The previous prime is 68909151149. The next prime is 68909151193. The reversal of 68909151169 is 96115190986.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67633804225 + 1275346944 = 260065^2 + 35712^2 .
It is a cyclic number.
It is not a de Polignac number, because 68909151169 - 217 = 68909020097 is a prime.
It is a super-2 number, since 2×689091511692 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (68909151149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34454575584 + 34454575585.
It is an arithmetic number, because the mean of its divisors is an integer number (34454575585).
Almost surely, 268909151169 is an apocalyptic number.
It is an amenable number.
68909151169 is a deficient number, since it is larger than the sum of its proper divisors (1).
68909151169 is an equidigital number, since it uses as much as digits as its factorization.
68909151169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1049760, while the sum is 55.
The spelling of 68909151169 in words is "sixty-eight billion, nine hundred nine million, one hundred fifty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •