Base | Representation |
---|---|
bin | 1010010100000100111100… |
… | …1100100000101111001001 |
3 | 1111011002122001022101221002 |
4 | 2211001033030200233021 |
5 | 2441243401314410241 |
6 | 40041313223024345 |
7 | 2250201551325611 |
oct | 245011714405711 |
9 | 44132561271832 |
10 | 11340042341321 |
11 | 36823152a3981 |
12 | 133193929b0b5 |
13 | 64349100b645 |
14 | 2b2c0a747a41 |
15 | 149ea941589b |
hex | a504f320bc9 |
11340042341321 has 8 divisors (see below), whose sum is σ = 11472022055424. Its totient is φ = 11208818958480.
The previous prime is 11340042341311. The next prime is 11340042341351. The reversal of 11340042341321 is 12314324004311.
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 11340042341321 - 238 = 11065164434377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11340042341311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189052655 + ... + 189112628.
It is an arithmetic number, because the mean of its divisors is an integer number (1434002756928).
Almost surely, 211340042341321 is an apocalyptic number.
It is an amenable number.
11340042341321 is a deficient number, since it is larger than the sum of its proper divisors (131979714103).
11340042341321 is a wasteful number, since it uses less digits than its factorization.
11340042341321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378165631.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 11340042341321 its reverse (12314324004311), we get a palindrome (23654366345632).
The spelling of 11340042341321 in words is "eleven trillion, three hundred forty billion, forty-two million, three hundred forty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •