Base | Representation |
---|---|
bin | 1010000010000010000000… |
… | …0001101010011100000011 |
3 | 1110001110101121000110102101 |
4 | 2200200200001222130003 |
5 | 2421203431402314021 |
6 | 35243041305131231 |
7 | 2215615004211634 |
oct | 240404001523403 |
9 | 43043347013371 |
10 | 11030013323011 |
11 | 3572890a727a1 |
12 | 12a1835189b17 |
13 | 6201834a2397 |
14 | 2a1bd968b88b |
15 | 141db1565a91 |
hex | a082006a703 |
11030013323011 has 2 divisors, whose sum is σ = 11030013323012. Its totient is φ = 11030013323010.
The previous prime is 11030013322967. The next prime is 11030013323039. The reversal of 11030013323011 is 11032331003011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11030013323011 - 29 = 11030013322499 is a prime.
It is a super-2 number, since 2×110300133230112 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11030013323011.
It is not a weakly prime, because it can be changed into another prime (11030013323081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515006661505 + 5515006661506.
It is an arithmetic number, because the mean of its divisors is an integer number (5515006661506).
Almost surely, 211030013323011 is an apocalyptic number.
11030013323011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030013323011 is an equidigital number, since it uses as much as digits as its factorization.
11030013323011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11030013323011 its reverse (11032331003011), we get a palindrome (22062344326022).
The spelling of 11030013323011 in words is "eleven trillion, thirty billion, thirteen million, three hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •