Base | Representation |
---|---|
bin | 1010000111010100110101… |
… | …0101011110010110000101 |
3 | 1110101011011100220211201022 |
4 | 2201311031111132112011 |
5 | 2424201220224214133 |
6 | 35352522503240525 |
7 | 2225314643434514 |
oct | 241651525362605 |
9 | 43334140824638 |
10 | 11120967804293 |
11 | 35a8415447796 |
12 | 12b7399749145 |
13 | 628919c85089 |
14 | 2a638724867b |
15 | 1444365d1998 |
hex | a1d4d55e585 |
11120967804293 has 2 divisors, whose sum is σ = 11120967804294. Its totient is φ = 11120967804292.
The previous prime is 11120967804269. The next prime is 11120967804299. The reversal of 11120967804293 is 39240876902111.
11120967804293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10740052948804 + 380914855489 = 3277202^2 + 617183^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120967804293 - 26 = 11120967804229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120967804299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560483902146 + 5560483902147.
It is an arithmetic number, because the mean of its divisors is an integer number (5560483902147).
Almost surely, 211120967804293 is an apocalyptic number.
It is an amenable number.
11120967804293 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120967804293 is an equidigital number, since it uses as much as digits as its factorization.
11120967804293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1306368, while the sum is 53.
The spelling of 11120967804293 in words is "eleven trillion, one hundred twenty billion, nine hundred sixty-seven million, eight hundred four thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •