Base | Representation |
---|---|
bin | 100000001011010110… |
… | …0000000010100111001 |
3 | 20121100201001100110100 |
4 | 1000112230000110321 |
5 | 2113004112024121 |
6 | 51424423110013 |
7 | 4664236153014 |
oct | 1002654002471 |
9 | 217321040410 |
10 | 69100111161 |
11 | 2733a236294 |
12 | 114855a2309 |
13 | 6692b8c753 |
14 | 34b72c837b |
15 | 1be6607026 |
hex | 1016b00539 |
69100111161 has 9 divisors (see below), whose sum is σ = 99812410789. Its totient is φ = 46066215036.
The previous prime is 69100111141. The next prime is 69100111163. The reversal of 69100111161 is 16111100196.
The square root of 69100111161 is 262869.
It is a perfect power (a square), and thus also a powerful number.
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 69100111161 - 27 = 69100111033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (69100111163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 744796 + ... + 832418.
Almost surely, 269100111161 is an apocalyptic number.
69100111161 is the 262869-th square number.
69100111161 is the 131435-th centered octagonal number.
It is an amenable number.
69100111161 is a deficient number, since it is larger than the sum of its proper divisors (30712299628).
69100111161 is an frugal number, since it uses more digits than its factorization.
69100111161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175252 (or 87626 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 27.
Multiplying 69100111161 by its product of nonzero digits (324), we get a square (22388436016164 = 47316422).
The spelling of 69100111161 in words is "sixty-nine billion, one hundred million, one hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •