Base | Representation |
---|---|
bin | 10000001100100101111… |
… | …100010101011101100001 |
3 | 10221101221012011000020201 |
4 | 100030211330111131201 |
5 | 121213442433300301 |
6 | 2211153110105201 |
7 | 143261666163655 |
oct | 20144574253541 |
9 | 3841835130221 |
10 | 1113033103201 |
11 | 39a042196368 |
12 | 15b86864b201 |
13 | 80c5cc9a566 |
14 | 3bc2a3aca65 |
15 | 1de44c91201 |
hex | 10325f15761 |
1113033103201 has 2 divisors, whose sum is σ = 1113033103202. Its totient is φ = 1113033103200.
The previous prime is 1113033103187. The next prime is 1113033103213. The reversal of 1113033103201 is 1023013303111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 600772259025 + 512260844176 = 775095^2 + 715724^2 .
It is an emirp because it is prime and its reverse (1023013303111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1113033103201 - 27 = 1113033103073 is a prime.
It is not a weakly prime, because it can be changed into another prime (1113033103271) 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 as a sum of consecutive naturals, namely, 556516551600 + 556516551601.
It is an arithmetic number, because the mean of its divisors is an integer number (556516551601).
Almost surely, 21113033103201 is an apocalyptic number.
It is an amenable number.
1113033103201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113033103201 is an equidigital number, since it uses as much as digits as its factorization.
1113033103201 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 1113033103201 its reverse (1023013303111), we get a palindrome (2136046406312).
The spelling of 1113033103201 in words is "one trillion, one hundred thirteen billion, thirty-three million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •