Base | Representation |
---|---|
bin | 110100101101101000… |
… | …1000000000101000001 |
3 | 101211012010101202002102 |
4 | 1221123101000011001 |
5 | 3323313241124441 |
6 | 124000432000145 |
7 | 11115131645501 |
oct | 1513321000501 |
9 | 354163352072 |
10 | 113200333121 |
11 | 4400a700817 |
12 | 19b32690055 |
13 | a8a0554245 |
14 | 569c257a01 |
15 | 2e2805e69b |
hex | 1a5b440141 |
113200333121 has 8 divisors (see below), whose sum is σ = 113571569280. Its totient is φ = 112829306688.
The previous prime is 113200333117. The next prime is 113200333139. The reversal of 113200333121 is 121333002311.
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 113200333121 - 22 = 113200333117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113200333093 and 113200333102.
It is not an unprimeable number, because it can be changed into a prime (113200333021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1067900 + ... + 1169106.
It is an arithmetic number, because the mean of its divisors is an integer number (14196446160).
Almost surely, 2113200333121 is an apocalyptic number.
It is an amenable number.
113200333121 is a deficient number, since it is larger than the sum of its proper divisors (371236159).
113200333121 is a wasteful number, since it uses less digits than its factorization.
113200333121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104863.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 113200333121 its reverse (121333002311), we get a palindrome (234533335432).
The spelling of 113200333121 in words is "one hundred thirteen billion, two hundred million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •