Base | Representation |
---|---|
bin | 1010000000010010001110… |
… | …1100001001000101001111 |
3 | 1102221120221121111201000002 |
4 | 2200010203230021011033 |
5 | 2420211010031103101 |
6 | 35221200154154515 |
7 | 2213503334302556 |
oct | 240044354110517 |
9 | 42846847451002 |
10 | 11000010019151 |
11 | 35610949824aa |
12 | 1297a61122a3b |
13 | 61a3b152154a |
14 | 2a0590a22d9d |
15 | 1412074d7d6b |
hex | a0123b0914f |
11000010019151 has 2 divisors, whose sum is σ = 11000010019152. Its totient is φ = 11000010019150.
The previous prime is 11000010019133. The next prime is 11000010019157. The reversal of 11000010019151 is 15191001000011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000010019151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000010019157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500005009575 + 5500005009576.
It is an arithmetic number, because the mean of its divisors is an integer number (5500005009576).
Almost surely, 211000010019151 is an apocalyptic number.
11000010019151 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000010019151 is an equidigital number, since it uses as much as digits as its factorization.
11000010019151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 20.
Adding to 11000010019151 its reverse (15191001000011), we get a palindrome (26191011019162).
The spelling of 11000010019151 in words is "eleven trillion, ten million, nineteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •