Base | Representation |
---|---|
bin | 1010100000111101010000… |
… | …0011110101000101111111 |
3 | 1111221020202220102021212210 |
4 | 2220033110003311011333 |
5 | 3003410033040022411 |
6 | 40331110015031503 |
7 | 2302164105034215 |
oct | 250172403650577 |
9 | 44836686367783 |
10 | 11561314767231 |
11 | 3758142868559 |
12 | 13687b0b0b593 |
13 | 65b2c5507688 |
14 | 2bd7dbad4cb5 |
15 | 150b0a19aca6 |
hex | a83d40f517f |
11561314767231 has 4 divisors (see below), whose sum is σ = 15415086356312. Its totient is φ = 7707543178152.
The previous prime is 11561314767151. The next prime is 11561314767251. The reversal of 11561314767231 is 13276741316511.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11561314767231 - 223 = 11561306378623 is a prime.
It is a super-2 number, since 2×115613147672312 (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 (11561314767251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1926885794536 + ... + 1926885794541.
It is an arithmetic number, because the mean of its divisors is an integer number (3853771589078).
Almost surely, 211561314767231 is an apocalyptic number.
11561314767231 is a deficient number, since it is larger than the sum of its proper divisors (3853771589081).
11561314767231 is an equidigital number, since it uses as much as digits as its factorization.
11561314767231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3853771589080.
The product of its digits is 635040, while the sum is 48.
The spelling of 11561314767231 in words is "eleven trillion, five hundred sixty-one billion, three hundred fourteen million, seven hundred sixty-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •