Base | Representation |
---|---|
bin | 110100110000100110… |
… | …1001101010101001001 |
3 | 101211110001221110020212 |
4 | 1221201031031111021 |
5 | 3324014300031441 |
6 | 124014352130505 |
7 | 11120452061615 |
oct | 1514115152511 |
9 | 354401843225 |
10 | 113300002121 |
11 | 44060996599 |
12 | 19b5bb36a35 |
13 | a8b80b0197 |
14 | 56ab5a0345 |
15 | 2e31b9aeeb |
hex | 1a6134d549 |
113300002121 has 8 divisors (see below), whose sum is σ = 117671840640. Its totient is φ = 109009880368.
The previous prime is 113300002093. The next prime is 113300002129. The reversal of 113300002121 is 121200003311.
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 113300002121 - 210 = 113300001097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113300002096 and 113300002105.
It is not an unprimeable number, because it can be changed into a prime (113300002129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20426366 + ... + 20431911.
It is an arithmetic number, because the mean of its divisors is an integer number (14708980080).
Almost surely, 2113300002121 is an apocalyptic number.
It is an amenable number.
113300002121 is a deficient number, since it is larger than the sum of its proper divisors (4371838519).
113300002121 is an equidigital number, since it uses as much as digits as its factorization.
113300002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40858383.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 113300002121 its reverse (121200003311), we get a palindrome (234500005432).
The spelling of 113300002121 in words is "one hundred thirteen billion, three hundred million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •