Base | Representation |
---|---|
bin | 100000001111010111… |
… | …0111001000111000001 |
3 | 20121201010000202210121 |
4 | 1000132232321013001 |
5 | 2113243140221021 |
6 | 51450044100241 |
7 | 5000465342662 |
oct | 1003656710701 |
9 | 217633022717 |
10 | 69235085761 |
11 | 273a9445746 |
12 | 11502834681 |
13 | 66b4b2a58a |
14 | 34cb1c1369 |
15 | 1c033b9741 |
hex | 101ebb91c1 |
69235085761 has 4 divisors (see below), whose sum is σ = 69241704532. Its totient is φ = 69228466992.
The previous prime is 69235085749. The next prime is 69235085767. The reversal of 69235085761 is 16758053296.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40481440000 + 28753645761 = 201200^2 + 169569^2 .
It is a cyclic number.
It is not a de Polignac number, because 69235085761 - 25 = 69235085729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 69235085699 and 69235085708.
It is not an unprimeable number, because it can be changed into a prime (69235085767) 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 in 3 ways as a sum of consecutive naturals, for example, 3293670 + ... + 3314623.
It is an arithmetic number, because the mean of its divisors is an integer number (17310426133).
Almost surely, 269235085761 is an apocalyptic number.
It is an amenable number.
69235085761 is a deficient number, since it is larger than the sum of its proper divisors (6618771).
69235085761 is a wasteful number, since it uses less digits than its factorization.
69235085761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6618770.
The product of its (nonzero) digits is 2721600, while the sum is 52.
The spelling of 69235085761 in words is "sixty-nine billion, two hundred thirty-five million, eighty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •