Base | Representation |
---|---|
bin | 1010000100011100011000… |
… | …0001110001001101110101 |
3 | 1110012102100121012221101102 |
4 | 2201013012001301031311 |
5 | 2422343313441334133 |
6 | 35314053314535445 |
7 | 2221612633246223 |
oct | 241070601611565 |
9 | 43172317187342 |
10 | 11071453074293 |
11 | 35894166a0227 |
12 | 12a987b297585 |
13 | 624058910981 |
14 | 2a3c0b157b13 |
15 | 142ed96457e8 |
hex | a11c6071375 |
11071453074293 has 4 divisors (see below), whose sum is σ = 11071570991040. Its totient is φ = 11071335157548.
The previous prime is 11071453074281. The next prime is 11071453074301. The reversal of 11071453074293 is 39247035417011.
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 11071453074293 - 24 = 11071453074277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11071453074233) 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 3 ways as a sum of consecutive naturals, for example, 58817423 + ... + 59005356.
It is an arithmetic number, because the mean of its divisors is an integer number (2767892747760).
Almost surely, 211071453074293 is an apocalyptic number.
It is an amenable number.
11071453074293 is a deficient number, since it is larger than the sum of its proper divisors (117916747).
11071453074293 is an equidigital number, since it uses as much as digits as its factorization.
11071453074293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117916746.
The product of its (nonzero) digits is 635040, while the sum is 47.
The spelling of 11071453074293 in words is "eleven trillion, seventy-one billion, four hundred fifty-three million, seventy-four thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •