Base | Representation |
---|---|
bin | 100000011011101110… |
… | …1101111011100010101 |
3 | 20122210000210121201201 |
4 | 1000313131233130111 |
5 | 2120120401120432 |
6 | 51555145352501 |
7 | 5013664255066 |
oct | 1006735573425 |
9 | 218700717651 |
10 | 69650020117 |
11 | 275a1690aa7 |
12 | 115b9798731 |
13 | 674ca9a672 |
14 | 352a35256d |
15 | 1c29a2cee7 |
hex | 103776f715 |
69650020117 has 2 divisors, whose sum is σ = 69650020118. Its totient is φ = 69650020116.
The previous prime is 69650020109. The next prime is 69650020123. The reversal of 69650020117 is 71102005696.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63604335601 + 6045684516 = 252199^2 + 77754^2 .
It is a cyclic number.
It is not a de Polignac number, because 69650020117 - 23 = 69650020109 is a prime.
It is a super-2 number, since 2×696500201172 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69650020147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34825010058 + 34825010059.
It is an arithmetic number, because the mean of its divisors is an integer number (34825010059).
Almost surely, 269650020117 is an apocalyptic number.
It is an amenable number.
69650020117 is a deficient number, since it is larger than the sum of its proper divisors (1).
69650020117 is an equidigital number, since it uses as much as digits as its factorization.
69650020117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
It can be divided in two parts, 696500 and 20117, that added together give a palindrome (716617).
The spelling of 69650020117 in words is "sixty-nine billion, six hundred fifty million, twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •