Base | Representation |
---|---|
bin | 100000100100101111… |
… | …0011011010000011101 |
3 | 20200120002101102011012 |
4 | 1001021132123100131 |
5 | 2121230230030334 |
6 | 52045142105005 |
7 | 5024323541231 |
oct | 1011136332035 |
9 | 220502342135 |
10 | 69952189469 |
11 | 27737207338 |
12 | 11682a1b165 |
13 | 679a5779b6 |
14 | 355852c5c1 |
15 | 1c463199ce |
hex | 104979b41d |
69952189469 has 2 divisors, whose sum is σ = 69952189470. Its totient is φ = 69952189468.
The previous prime is 69952189459. The next prime is 69952189481. The reversal of 69952189469 is 96498125996.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62737725625 + 7214463844 = 250475^2 + 84938^2 .
It is a cyclic number.
It is not a de Polignac number, because 69952189469 - 24 = 69952189453 is a prime.
It is a super-2 number, since 2×699521894692 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 69952189399 and 69952189408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69952189459) 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, 34976094734 + 34976094735.
It is an arithmetic number, because the mean of its divisors is an integer number (34976094735).
Almost surely, 269952189469 is an apocalyptic number.
It is an amenable number.
69952189469 is a deficient number, since it is larger than the sum of its proper divisors (1).
69952189469 is an equidigital number, since it uses as much as digits as its factorization.
69952189469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75582720, while the sum is 68.
The spelling of 69952189469 in words is "sixty-nine billion, nine hundred fifty-two million, one hundred eighty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •