Base | Representation |
---|---|
bin | 1010000000110111111100… |
… | …0001010100011110011101 |
3 | 1102222120002001020101202201 |
4 | 2200031333001110132131 |
5 | 2420342222322411333 |
6 | 35225552424251501 |
7 | 2214312224553511 |
oct | 240157701243635 |
9 | 42876061211681 |
10 | 11010132232093 |
11 | 356540967a945 |
12 | 1299a07010b91 |
13 | 61b33562bc67 |
14 | 2a0c710ba141 |
15 | 1415eae8717d |
hex | a037f05479d |
11010132232093 has 2 divisors, whose sum is σ = 11010132232094. Its totient is φ = 11010132232092.
The previous prime is 11010132232091. The next prime is 11010132232123. The reversal of 11010132232093 is 39023223101011.
11010132232093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10605358888569 + 404773343524 = 3256587^2 + 636218^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010132232093 - 21 = 11010132232091 is a prime.
Together with 11010132232091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010132232091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505066116046 + 5505066116047.
It is an arithmetic number, because the mean of its divisors is an integer number (5505066116047).
Almost surely, 211010132232093 is an apocalyptic number.
It is an amenable number.
11010132232093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010132232093 is an equidigital number, since it uses as much as digits as its factorization.
11010132232093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 11010132232093 in words is "eleven trillion, ten billion, one hundred thirty-two million, two hundred thirty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •