Base | Representation |
---|---|
bin | 100000001011011110… |
… | …0000011001011001001 |
3 | 20121100222222000221221 |
4 | 1000112330003023021 |
5 | 2113011201122004 |
6 | 51425053202041 |
7 | 4664320001221 |
oct | 1002674031311 |
9 | 217328860857 |
10 | 69104317129 |
11 | 273416492a1 |
12 | 11486a90321 |
13 | 6693a02ca3 |
14 | 34b7aa1081 |
15 | 1be6b88354 |
hex | 1016f032c9 |
69104317129 has 3 divisors (see below), whose sum is σ = 69104580007. Its totient is φ = 69104054252.
The previous prime is 69104317103. The next prime is 69104317153. The reversal of 69104317129 is 92171340196.
The square root of 69104317129 is 262877.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 1581255225 + 67523061904 = 39765^2 + 259852^2 .
It is a de Polignac number, because none of the positive numbers 2k-69104317129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (69104317169) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 131439 + ... + 394315.
Almost surely, 269104317129 is an apocalyptic number.
69104317129 is the 262877-th square number.
69104317129 is the 131439-th centered octagonal number.
It is an amenable number.
69104317129 is a deficient number, since it is larger than the sum of its proper divisors (262878).
69104317129 is an frugal number, since it uses more digits than its factorization.
69104317129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525754 (or 262877 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 43.
The spelling of 69104317129 in words is "sixty-nine billion, one hundred four million, three hundred seventeen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •