Base | Representation |
---|---|
bin | 10000001100100101111… |
… | …100010101011011100001 |
3 | 10221101221012011000001222 |
4 | 100030211330111123201 |
5 | 121213442433244243 |
6 | 2211153110104425 |
7 | 143261666163413 |
oct | 20144574253341 |
9 | 3841835130058 |
10 | 1113033103073 |
11 | 39a042196261 |
12 | 15b86864b115 |
13 | 80c5cc9a498 |
14 | 3bc2a3ac9b3 |
15 | 1de44c91168 |
hex | 10325f156e1 |
1113033103073 has 2 divisors, whose sum is σ = 1113033103074. Its totient is φ = 1113033103072.
The previous prime is 1113033102949. The next prime is 1113033103139. The reversal of 1113033103073 is 3703013303111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1091036653729 + 21996449344 = 1044527^2 + 148312^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113033103073 - 232 = 1108738135777 is a prime.
It is a super-2 number, since 2×11130331030732 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1113033103873) 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, 556516551536 + 556516551537.
It is an arithmetic number, because the mean of its divisors is an integer number (556516551537).
Almost surely, 21113033103073 is an apocalyptic number.
It is an amenable number.
1113033103073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113033103073 is an equidigital number, since it uses as much as digits as its factorization.
1113033103073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 26.
Adding to 1113033103073 its reverse (3703013303111), we get a palindrome (4816046406184).
The spelling of 1113033103073 in words is "one trillion, one hundred thirteen billion, thirty-three million, one hundred three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •