Base | Representation |
---|---|
bin | 10000000001101011001… |
… | …100010111110001110011 |
3 | 10220021200012010100011220 |
4 | 100001223030113301303 |
5 | 121020440332024021 |
6 | 2201533532040123 |
7 | 142365326552526 |
oct | 20015314276163 |
9 | 3807605110156 |
10 | 1101310033011 |
11 | 395076891201 |
12 | 159536603043 |
13 | 7cb12316b36 |
14 | 3b43747abbd |
15 | 1d9aa9c3cc6 |
hex | 1006b317c73 |
1101310033011 has 4 divisors (see below), whose sum is σ = 1468413377352. Its totient is φ = 734206688672.
The previous prime is 1101310033003. The next prime is 1101310033049. The reversal of 1101310033011 is 1103300131011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1101310033011 - 23 = 1101310033003 is a prime.
It is a super-2 number, since 2×11013100330112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1101310033051) 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 in 3 ways as a sum of consecutive naturals, for example, 183551672166 + ... + 183551672171.
It is an arithmetic number, because the mean of its divisors is an integer number (367103344338).
Almost surely, 21101310033011 is an apocalyptic number.
1101310033011 is a deficient number, since it is larger than the sum of its proper divisors (367103344341).
1101310033011 is an equidigital number, since it uses as much as digits as its factorization.
1101310033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367103344340.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1101310033011 its reverse (1103300131011), we get a palindrome (2204610164022).
The spelling of 1101310033011 in words is "one trillion, one hundred one billion, three hundred ten million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •