Base | Representation |
---|---|
bin | 10000001100110111001… |
… | …110001111110000111101 |
3 | 10221102200101122212011112 |
4 | 100030313032033300331 |
5 | 121220041142324013 |
6 | 2211241543531405 |
7 | 143302116311414 |
oct | 20146716176075 |
9 | 3842611585145 |
10 | 1113323011133 |
11 | 39a1808a74a3 |
12 | 15b929759b65 |
13 | 80ca8073908 |
14 | 3bc56ab647b |
15 | 1de60459ba8 |
hex | 1033738fc3d |
1113323011133 has 2 divisors, whose sum is σ = 1113323011134. Its totient is φ = 1113323011132.
The previous prime is 1113323011117. The next prime is 1113323011223. The reversal of 1113323011133 is 3311103233111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1105805774329 + 7517236804 = 1051573^2 + 86702^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113323011133 - 24 = 1113323011117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1113323011099 and 1113323011108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113323061133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556661505566 + 556661505567.
It is an arithmetic number, because the mean of its divisors is an integer number (556661505567).
Almost surely, 21113323011133 is an apocalyptic number.
It is an amenable number.
1113323011133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113323011133 is an equidigital number, since it uses as much as digits as its factorization.
1113323011133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1113323011133 its reverse (3311103233111), we get a palindrome (4424426244244).
The spelling of 1113323011133 in words is "one trillion, one hundred thirteen billion, three hundred twenty-three million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •