Base | Representation |
---|---|
bin | 11001101110001001000110… |
… | …100110000011000011000001 |
3 | 112211112100201222110211202012 |
4 | 121232021012212003003001 |
5 | 104311342410423133441 |
6 | 1040331313342302305 |
7 | 32553540301401425 |
oct | 3156110646030301 |
9 | 484470658424665 |
10 | 113122033021121 |
11 | 3305386a611933 |
12 | 1082b983b87995 |
13 | 4b17492254ba7 |
14 | 1dd11c8192b85 |
15 | d1286c6439eb |
hex | 66e2469830c1 |
113122033021121 has 64 divisors (see below), whose sum is σ = 122627457792000. Its totient is φ = 104106836951040.
The previous prime is 113122033021111. The next prime is 113122033021169. The reversal of 113122033021121 is 121120330221311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 113122033021121 - 214 = 113122033004737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113122033021111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 43862749010 + ... + 43862751588.
It is an arithmetic number, because the mean of its divisors is an integer number (1916054028000).
Almost surely, 2113122033021121 is an apocalyptic number.
It is an amenable number.
113122033021121 is a deficient number, since it is larger than the sum of its proper divisors (9505424770879).
113122033021121 is a wasteful number, since it uses less digits than its factorization.
113122033021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4634.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 113122033021121 its reverse (121120330221311), we get a palindrome (234242363242432).
The spelling of 113122033021121 in words is "one hundred thirteen trillion, one hundred twenty-two billion, thirty-three million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •