Base | Representation |
---|---|
bin | 1010000010001010101000… |
… | …0111100010111101011011 |
3 | 1110001200101001110222212012 |
4 | 2200202222013202331123 |
5 | 2421223203002333201 |
6 | 35244103230140135 |
7 | 2216026265525111 |
oct | 240425207427533 |
9 | 43050331428765 |
10 | 11032330121051 |
11 | 357386a817418 |
12 | 12a218105164b |
13 | 6204624793b5 |
14 | 2a1d7924dab1 |
15 | 141e99b545bb |
hex | a08aa1e2f5b |
11032330121051 has 2 divisors, whose sum is σ = 11032330121052. Its totient is φ = 11032330121050.
The previous prime is 11032330120961. The next prime is 11032330121101. The reversal of 11032330121051 is 15012103323011.
It is a strong prime.
It is an emirp because it is prime and its reverse (15012103323011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11032330121051 - 234 = 11015150251867 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11032330121551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516165060525 + 5516165060526.
It is an arithmetic number, because the mean of its divisors is an integer number (5516165060526).
Almost surely, 211032330121051 is an apocalyptic number.
11032330121051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032330121051 is an equidigital number, since it uses as much as digits as its factorization.
11032330121051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 11032330121051 its reverse (15012103323011), we get a palindrome (26044433444062).
The spelling of 11032330121051 in words is "eleven trillion, thirty-two billion, three hundred thirty million, one hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •