Base | Representation |
---|---|
bin | 110100101011010011… |
… | …0010011001000101001 |
3 | 101210222200001112120022 |
4 | 1221112212103020221 |
5 | 3323133214430441 |
6 | 123544553410225 |
7 | 11113161251042 |
oct | 1512646231051 |
9 | 353880045508 |
10 | 113122030121 |
11 | 43a7a4895a1 |
12 | 19b10409975 |
13 | a88a2693c9 |
14 | 5691ab38c9 |
15 | 2e2124384b |
hex | 1a56993229 |
113122030121 has 8 divisors (see below), whose sum is σ = 119079544320. Its totient is φ = 107164888272.
The previous prime is 113122030081. The next prime is 113122030127. The reversal of 113122030121 is 121030221311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113122030121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113122030121.
It is not an unprimeable number, because it can be changed into a prime (113122030127) 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, 706871 + ... + 852003.
It is an arithmetic number, because the mean of its divisors is an integer number (14884943040).
Almost surely, 2113122030121 is an apocalyptic number.
It is an amenable number.
113122030121 is a deficient number, since it is larger than the sum of its proper divisors (5957514199).
113122030121 is a wasteful number, since it uses less digits than its factorization.
113122030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186175.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 113122030121 its reverse (121030221311), we get a palindrome (234152251432).
The spelling of 113122030121 in words is "one hundred thirteen billion, one hundred twenty-two million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •