Base | Representation |
---|---|
bin | 100000001011101110… |
… | …1100101111011000101 |
3 | 20121101121111202210201 |
4 | 1000113131211323011 |
5 | 2113020424011323 |
6 | 51430005450501 |
7 | 4664454513100 |
oct | 1002735457305 |
9 | 217347452721 |
10 | 69113110213 |
11 | 27346604704 |
12 | 11489a10a31 |
13 | 66957913b4 |
14 | 34b8d0d737 |
15 | 1be78238ad |
hex | 1017765ec5 |
69113110213 has 12 divisors (see below), whose sum is σ = 83169191340. Its totient is φ = 57197055552.
The previous prime is 69113110211. The next prime is 69113110237. The reversal of 69113110213 is 31201131196.
It can be written as a sum of positive squares in 2 ways, for example, as 12781885249 + 56331224964 = 113057^2 + 237342^2 .
It is not a de Polignac number, because 69113110213 - 21 = 69113110211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69113110211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24317056 + ... + 24319897.
It is an arithmetic number, because the mean of its divisors is an integer number (6930765945).
Almost surely, 269113110213 is an apocalyptic number.
It is an amenable number.
69113110213 is a deficient number, since it is larger than the sum of its proper divisors (14056081127).
69113110213 is a wasteful number, since it uses less digits than its factorization.
69113110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48636996 (or 48636989 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 28.
The spelling of 69113110213 in words is "sixty-nine billion, one hundred thirteen million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •