Base | Representation |
---|---|
bin | 1010000000111000101011… |
… | …0111101000111101011011 |
3 | 1102222120120220021221002021 |
4 | 2200032022313220331123 |
5 | 2420343124220134042 |
6 | 35230024245115311 |
7 | 2214320160335443 |
oct | 240161267507533 |
9 | 42876526257067 |
10 | 11010331021147 |
11 | 3565500906017 |
12 | 1299a616b8b37 |
13 | 61b367881013 |
14 | 2a0c8d665123 |
15 | 14160d652867 |
hex | a038ade8f5b |
11010331021147 has 2 divisors, whose sum is σ = 11010331021148. Its totient is φ = 11010331021146.
The previous prime is 11010331021093. The next prime is 11010331021189. The reversal of 11010331021147 is 74112013301011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11010331021147 - 235 = 10975971282779 is a prime.
It is a super-2 number, since 2×110103310211472 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11010331021247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505165510573 + 5505165510574.
It is an arithmetic number, because the mean of its divisors is an integer number (5505165510574).
Almost surely, 211010331021147 is an apocalyptic number.
11010331021147 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010331021147 is an equidigital number, since it uses as much as digits as its factorization.
11010331021147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 11010331021147 its reverse (74112013301011), we get a palindrome (85122344322158).
The spelling of 11010331021147 in words is "eleven trillion, ten billion, three hundred thirty-one million, twenty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •