Base | Representation |
---|---|
bin | 1010010111000110011001… |
… | …1100000010101111110011 |
3 | 1111100001200002221010101102 |
4 | 2211301212130002233303 |
5 | 2443121224301140212 |
6 | 40121222153355015 |
7 | 2254020453264242 |
oct | 245614634025763 |
9 | 44301602833342 |
10 | 11391971896307 |
11 | 36a2343169172 |
12 | 133ba10408a6b |
13 | 64834875c482 |
14 | 2b5535436959 |
15 | 14b4e83a55c2 |
hex | a5c66702bf3 |
11391971896307 has 8 divisors (see below), whose sum is σ = 11760843988992. Its totient is φ = 11023186624200.
The previous prime is 11391971896297. The next prime is 11391971896309. The reversal of 11391971896307 is 70369817919311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11391971896307 - 214 = 11391971879923 is a prime.
It is a super-4 number, since 4×113919718963074 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11391971896309) 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 7 ways as a sum of consecutive naturals, for example, 21438419 + ... + 21963372.
It is an arithmetic number, because the mean of its divisors is an integer number (1470105498624).
Almost surely, 211391971896307 is an apocalyptic number.
11391971896307 is a deficient number, since it is larger than the sum of its proper divisors (368872092685).
11391971896307 is an equidigital number, since it uses as much as digits as its factorization.
11391971896307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43410289.
The product of its (nonzero) digits is 15431472, while the sum is 65.
The spelling of 11391971896307 in words is "eleven trillion, three hundred ninety-one billion, nine hundred seventy-one million, eight hundred ninety-six thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •