Base | Representation |
---|---|
bin | 1010000010000010101111… |
… | …1000000000110110110111 |
3 | 1110001110220110002101121111 |
4 | 2200200223320000312313 |
5 | 2421204333300314431 |
6 | 35243113130055451 |
7 | 2215622640025651 |
oct | 240405370006667 |
9 | 43043813071544 |
10 | 11030212119991 |
11 | 3572983203919 |
12 | 12a188b87a587 |
13 | 6201b5727c2c |
14 | 2a1c17c396d1 |
15 | 141dc3c337b1 |
hex | a082be00db7 |
11030212119991 has 2 divisors, whose sum is σ = 11030212119992. Its totient is φ = 11030212119990.
The previous prime is 11030212119967. The next prime is 11030212120043. The reversal of 11030212119991 is 19991121203011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11030212119991 - 25 = 11030212119959 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11030212119961) 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 as a sum of consecutive naturals, namely, 5515106059995 + 5515106059996.
It is an arithmetic number, because the mean of its divisors is an integer number (5515106059996).
Almost surely, 211030212119991 is an apocalyptic number.
11030212119991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030212119991 is an equidigital number, since it uses as much as digits as its factorization.
11030212119991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 40.
The spelling of 11030212119991 in words is "eleven trillion, thirty billion, two hundred twelve million, one hundred nineteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •