Base | Representation |
---|---|
bin | 111000110100011110… |
… | …1101111110000000001 |
3 | 102122221210100101021111 |
4 | 1301220331233300001 |
5 | 3444344121213441 |
6 | 132015534123321 |
7 | 11546525514022 |
oct | 1615075576001 |
9 | 378853311244 |
10 | 122020101121 |
11 | 47826190a86 |
12 | 1b794350541 |
13 | b67787bb89 |
14 | 5c97754c49 |
15 | 32924d9081 |
hex | 1c68f6fc01 |
122020101121 has 8 divisors (see below), whose sum is σ = 123190764840. Its totient is φ = 120850368768.
The previous prime is 122020101109. The next prime is 122020101131. The reversal of 122020101121 is 121101020221.
It can be written as a sum of positive squares in 4 ways, for example, as 99830721600 + 22189379521 = 315960^2 + 148961^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122020101121 - 223 = 122011712513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122020101131) 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 7 ways as a sum of consecutive naturals, for example, 31875 + ... + 495031.
It is an arithmetic number, because the mean of its divisors is an integer number (15398845605).
Almost surely, 2122020101121 is an apocalyptic number.
It is an amenable number.
122020101121 is a deficient number, since it is larger than the sum of its proper divisors (1170663719).
122020101121 is a wasteful number, since it uses less digits than its factorization.
122020101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465683.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122020101121 its reverse (121101020221), we get a palindrome (243121121342).
The spelling of 122020101121 in words is "one hundred twenty-two billion, twenty million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •