Base | Representation |
---|---|
bin | 10011111100000111110… |
… | …11101110011110010011 |
3 | 2102111101201111021022110 |
4 | 21332003323232132103 |
5 | 42211102444202321 |
6 | 1242423043040403 |
7 | 100332513504534 |
oct | 11760373563623 |
9 | 2374351437273 |
10 | 685113272211 |
11 | 244611643785 |
12 | b0943070103 |
13 | 4c7b5230784 |
14 | 2523416868b |
15 | 12c4c1ba176 |
hex | 9f83eee793 |
685113272211 has 4 divisors (see below), whose sum is σ = 913484362952. Its totient is φ = 456742181472.
The previous prime is 685113272203. The next prime is 685113272219. The reversal of 685113272211 is 112272311586.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (685113272203) and next prime (685113272219).
It is not a de Polignac number, because 685113272211 - 23 = 685113272203 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 685113272211.
It is not an unprimeable number, because it can be changed into a prime (685113272219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114185545366 + ... + 114185545371.
It is an arithmetic number, because the mean of its divisors is an integer number (228371090738).
Almost surely, 2685113272211 is an apocalyptic number.
685113272211 is a deficient number, since it is larger than the sum of its proper divisors (228371090741).
685113272211 is a wasteful number, since it uses less digits than its factorization.
685113272211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228371090740.
The product of its digits is 40320, while the sum is 39.
Adding to 685113272211 its reverse (112272311586), we get a palindrome (797385583797).
The spelling of 685113272211 in words is "six hundred eighty-five billion, one hundred thirteen million, two hundred seventy-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •