Base | Representation |
---|---|
bin | 11001110001001011000100… |
… | …010001100011111010010101 |
3 | 112212021021022110120002012211 |
4 | 121301023010101203322111 |
5 | 104323300423300311013 |
6 | 1041011115430513421 |
7 | 32604562324526263 |
oct | 3161130421437225 |
9 | 485237273502184 |
10 | 113330300010133 |
11 | 33124123928258 |
12 | 10864208205871 |
13 | 4b310031c762b |
14 | 1ddb30419b433 |
15 | d17eab75123d |
hex | 6712c4463e95 |
113330300010133 has 8 divisors (see below), whose sum is σ = 117925386444288. Its totient is φ = 108826205386704.
The previous prime is 113330300010131. The next prime is 113330300010163. The reversal of 113330300010133 is 331010003033311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113330300010133 - 21 = 113330300010131 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 (113330300010131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22747950141 + ... + 22747955122.
It is an arithmetic number, because the mean of its divisors is an integer number (14740673305536).
Almost surely, 2113330300010133 is an apocalyptic number.
It is an amenable number.
113330300010133 is a deficient number, since it is larger than the sum of its proper divisors (4595086434155).
113330300010133 is an equidigital number, since it uses as much as digits as its factorization.
113330300010133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45495905363.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 113330300010133 its reverse (331010003033311), we get a palindrome (444340303043444).
The spelling of 113330300010133 in words is "one hundred thirteen trillion, three hundred thirty billion, three hundred million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •