Base | Representation |
---|---|
bin | 100000010000010000… |
… | …0011011111111100001 |
3 | 20121210012000222220122 |
4 | 1000200200123333201 |
5 | 2113323300212123 |
6 | 51453030050025 |
7 | 5001306342566 |
oct | 1004040337741 |
9 | 217705028818 |
10 | 69264850913 |
11 | 27414225745 |
12 | 115107a9915 |
13 | 66bb04c6ab |
14 | 34d112c86d |
15 | 1c05ce8bc8 |
hex | 102081bfe1 |
69264850913 has 2 divisors, whose sum is σ = 69264850914. Its totient is φ = 69264850912.
The previous prime is 69264850901. The next prime is 69264850927. The reversal of 69264850913 is 31905846296.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68724195409 + 540655504 = 262153^2 + 23252^2 .
It is a cyclic number.
It is not a de Polignac number, because 69264850913 - 26 = 69264850849 is a prime.
It is not a weakly prime, because it can be changed into another prime (69264850933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34632425456 + 34632425457.
It is an arithmetic number, because the mean of its divisors is an integer number (34632425457).
Almost surely, 269264850913 is an apocalyptic number.
It is an amenable number.
69264850913 is a deficient number, since it is larger than the sum of its proper divisors (1).
69264850913 is an equidigital number, since it uses as much as digits as its factorization.
69264850913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 53.
The spelling of 69264850913 in words is "sixty-nine billion, two hundred sixty-four million, eight hundred fifty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •