Base | Representation |
---|---|
bin | 100000001011010100… |
… | …0000010110100001101 |
3 | 20121100122002121001211 |
4 | 1000112220002310031 |
5 | 2113003330312111 |
6 | 51424344534421 |
7 | 4664224266454 |
oct | 1002650026415 |
9 | 217318077054 |
10 | 69099072781 |
11 | 27339697122 |
12 | 11485181411 |
13 | 66928b7c1b |
14 | 34b70d7b9b |
15 | 1be649e521 |
hex | 1016a02d0d |
69099072781 has 2 divisors, whose sum is σ = 69099072782. Its totient is φ = 69099072780.
The previous prime is 69099072751. The next prime is 69099072817. The reversal of 69099072781 is 18727099096.
It is a happy number.
Together with next prime (69099072817) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68961386025 + 137686756 = 262605^2 + 11734^2 .
It is a cyclic number.
It is not a de Polignac number, because 69099072781 - 215 = 69099040013 is a prime.
It is a super-2 number, since 2×690990727812 (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 (69099072751) 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 as a sum of consecutive naturals, namely, 34549536390 + 34549536391.
It is an arithmetic number, because the mean of its divisors is an integer number (34549536391).
Almost surely, 269099072781 is an apocalyptic number.
It is an amenable number.
69099072781 is a deficient number, since it is larger than the sum of its proper divisors (1).
69099072781 is an equidigital number, since it uses as much as digits as its factorization.
69099072781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3429216, while the sum is 58.
The spelling of 69099072781 in words is "sixty-nine billion, ninety-nine million, seventy-two thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •