Base | Representation |
---|---|
bin | 110100101000010010… |
… | …1010110111001111001 |
3 | 101210201122011210001220 |
4 | 1221100211112321321 |
5 | 3322431401320441 |
6 | 123530550502253 |
7 | 11110524445560 |
oct | 1512045267171 |
9 | 353648153056 |
10 | 113021120121 |
11 | 43a285263a8 |
12 | 19aa2664989 |
13 | a872397650 |
14 | 5682526bd7 |
15 | 2e1745e466 |
hex | 1a50956e79 |
113021120121 has 32 divisors (see below), whose sum is σ = 185506234368. Its totient is φ = 59604068160.
The previous prime is 113021120081. The next prime is 113021120123. The reversal of 113021120121 is 121021120311.
It is not a de Polignac number, because 113021120121 - 211 = 113021118073 is a prime.
It is a super-2 number, since 2×1130211201212 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 113021120121.
It is not an unprimeable number, because it can be changed into a prime (113021120123) 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 31 ways as a sum of consecutive naturals, for example, 1489320 + ... + 1563366.
It is an arithmetic number, because the mean of its divisors is an integer number (5797069824).
Almost surely, 2113021120121 is an apocalyptic number.
It is an amenable number.
113021120121 is a deficient number, since it is larger than the sum of its proper divisors (72485114247).
113021120121 is a wasteful number, since it uses less digits than its factorization.
113021120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79661.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 113021120121 its reverse (121021120311), we get a palindrome (234042240432).
The spelling of 113021120121 in words is "one hundred thirteen billion, twenty-one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •