Base | Representation |
---|---|
bin | 11001011110000111101101… |
… | …000111011100110010111001 |
3 | 112200122002211111121102210120 |
4 | 121132013231013130302321 |
5 | 104140323022132400441 |
6 | 1034125425104403453 |
7 | 32411152211004114 |
oct | 3136075507346271 |
9 | 480562744542716 |
10 | 112021020200121 |
11 | 3276993658049a |
12 | 10692511016589 |
13 | 4a676c96a0b66 |
14 | 1d93bbc3a157b |
15 | ce3dccccc966 |
hex | 65e1ed1dccb9 |
112021020200121 has 8 divisors (see below), whose sum is σ = 153004320273504. Its totient is φ = 72859200130080.
The previous prime is 112021020200083. The next prime is 112021020200123. The reversal of 112021020200121 is 121002020120211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112021020200121 - 29 = 112021020199609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112021020200121.
It is not an unprimeable number, because it can be changed into a prime (112021020200123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 455370000691 + ... + 455370000936.
It is an arithmetic number, because the mean of its divisors is an integer number (19125540034188).
Almost surely, 2112021020200121 is an apocalyptic number.
It is an amenable number.
112021020200121 is a deficient number, since it is larger than the sum of its proper divisors (40983300073383).
112021020200121 is an equidigital number, since it uses as much as digits as its factorization.
112021020200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910740001671.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112021020200121 its reverse (121002020120211), we get a palindrome (233023040320332).
The spelling of 112021020200121 in words is "one hundred twelve trillion, twenty-one billion, twenty million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •