Base | Representation |
---|---|
bin | 10000001100101001111… |
… | …100101010111101100101 |
3 | 10221102002212120222002222 |
4 | 100030221330222331211 |
5 | 121214112134101013 |
6 | 2211203510242125 |
7 | 143263443304253 |
oct | 20145174527545 |
9 | 3842085528088 |
10 | 1113100300133 |
11 | 39a077112418 |
12 | 15b887056345 |
13 | 80c70b97263 |
14 | 3bc352a15d3 |
15 | 1de4ab16508 |
hex | 10329f2af65 |
1113100300133 has 4 divisors (see below), whose sum is σ = 1121225119980. Its totient is φ = 1104975480288.
The previous prime is 1113100300069. The next prime is 1113100300157. The reversal of 1113100300133 is 3310030013111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 416130786724 + 696969513409 = 645082^2 + 834847^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113100300133 - 26 = 1113100300069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113100300163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4062409718 + ... + 4062409991.
It is an arithmetic number, because the mean of its divisors is an integer number (280306279995).
Almost surely, 21113100300133 is an apocalyptic number.
It is an amenable number.
1113100300133 is a deficient number, since it is larger than the sum of its proper divisors (8124819847).
1113100300133 is an equidigital number, since it uses as much as digits as its factorization.
1113100300133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8124819846.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1113100300133 its reverse (3310030013111), we get a palindrome (4423130313244).
The spelling of 1113100300133 in words is "one trillion, one hundred thirteen billion, one hundred million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •