Base | Representation |
---|---|
bin | 110100101000010000… |
… | …1001010100110000001 |
3 | 101210201120002221112012 |
4 | 1221100201022212001 |
5 | 3322431111133441 |
6 | 123530511142305 |
7 | 11110512220520 |
oct | 1512041124601 |
9 | 353646087465 |
10 | 113020021121 |
11 | 43a27945737 |
12 | 19aa2214995 |
13 | a8720a1357 |
14 | 568231c4b7 |
15 | 2e172e39eb |
hex | 1a5084a981 |
113020021121 has 8 divisors (see below), whose sum is σ = 132316122624. Its totient is φ = 94511515680.
The previous prime is 113020021099. The next prime is 113020021133. The reversal of 113020021121 is 121120020311.
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-113020021121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113020021096 and 113020021105.
It is not an unprimeable number, because it can be changed into a prime (113020021171) 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, 196898705 + ... + 196899278.
It is an arithmetic number, because the mean of its divisors is an integer number (16539515328).
Almost surely, 2113020021121 is an apocalyptic number.
It is an amenable number.
113020021121 is a deficient number, since it is larger than the sum of its proper divisors (19296101503).
113020021121 is an equidigital number, since it uses as much as digits as its factorization.
113020021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393798031.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 113020021121 its reverse (121120020311), we get a palindrome (234140041432).
The spelling of 113020021121 in words is "one hundred thirteen billion, twenty million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •