Base | Representation |
---|---|
bin | 100000100100010111… |
… | …1101000010011011101 |
3 | 20200112020022011112201 |
4 | 1001020233220103131 |
5 | 2121214110002031 |
6 | 52044023131501 |
7 | 5024114346355 |
oct | 1011057502335 |
9 | 220466264481 |
10 | 69939922141 |
11 | 27730298751 |
12 | 1167a8a3b91 |
13 | 6797b7111b |
14 | 3556a57b65 |
15 | 1c451e4d61 |
hex | 1048be84dd |
69939922141 has 2 divisors, whose sum is σ = 69939922142. Its totient is φ = 69939922140.
The previous prime is 69939922111. The next prime is 69939922153. The reversal of 69939922141 is 14122993996.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67847225625 + 2092696516 = 260475^2 + 45746^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-69939922141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69939922111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34969961070 + 34969961071.
It is an arithmetic number, because the mean of its divisors is an integer number (34969961071).
Almost surely, 269939922141 is an apocalyptic number.
It is an amenable number.
69939922141 is a deficient number, since it is larger than the sum of its proper divisors (1).
69939922141 is an equidigital number, since it uses as much as digits as its factorization.
69939922141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1889568, while the sum is 55.
The spelling of 69939922141 in words is "sixty-nine billion, nine hundred thirty-nine million, nine hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •