Base | Representation |
---|---|
bin | 1010101001110100110001… |
… | …1010011011010111110101 |
3 | 1112110210222221201211120121 |
4 | 2222131030122123113311 |
5 | 3013404032344444334 |
6 | 40525102523131541 |
7 | 2316166234410154 |
oct | 252351432332765 |
9 | 45423887654517 |
10 | 11713657812469 |
11 | 3806809508228 |
12 | 1392228373bb1 |
13 | 66c793320922 |
14 | 2c6d3071b59b |
15 | 154a74800db4 |
hex | aa74c69b5f5 |
11713657812469 has 4 divisors (see below), whose sum is σ = 11713809922144. Its totient is φ = 11713505702796.
The previous prime is 11713657812403. The next prime is 11713657812491. The reversal of 11713657812469 is 96421875631711.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11713657812469 - 27 = 11713657812341 is a prime.
It is a super-2 number, since 2×117136578124692 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11713657813469) 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, 75939267 + ... + 76093360.
It is an arithmetic number, because the mean of its divisors is an integer number (2928452480536).
Almost surely, 211713657812469 is an apocalyptic number.
It is an amenable number.
11713657812469 is a deficient number, since it is larger than the sum of its proper divisors (152109675).
11713657812469 is an equidigital number, since it uses as much as digits as its factorization.
11713657812469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152109674.
The product of its digits is 15240960, while the sum is 61.
The spelling of 11713657812469 in words is "eleven trillion, seven hundred thirteen billion, six hundred fifty-seven million, eight hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •