Base | Representation |
---|---|
bin | 111000110100011111… |
… | …0100111111001011101 |
3 | 102122221210210001202021 |
4 | 1301220332213321131 |
5 | 3444344201043401 |
6 | 132015543100141 |
7 | 11546530462354 |
oct | 1615076477135 |
9 | 378853701667 |
10 | 122020331101 |
11 | 47826328849 |
12 | 1b794441651 |
13 | b67792c766 |
14 | 5c977b499b |
15 | 32925322a1 |
hex | 1c68fa7e5d |
122020331101 has 8 divisors (see below), whose sum is σ = 127436212224. Its totient is φ = 116613670800.
The previous prime is 122020331099. The next prime is 122020331159. The reversal of 122020331101 is 101133020221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122020331101 - 21 = 122020331099 is a prime.
It is a super-2 number, since 2×1220203311012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122020331501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2278146 + ... + 2331091.
It is an arithmetic number, because the mean of its divisors is an integer number (15929526528).
Almost surely, 2122020331101 is an apocalyptic number.
It is an amenable number.
122020331101 is a deficient number, since it is larger than the sum of its proper divisors (5415881123).
122020331101 is a wasteful number, since it uses less digits than its factorization.
122020331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4610411.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 122020331101 its reverse (101133020221), we get a palindrome (223153351322).
The spelling of 122020331101 in words is "one hundred twenty-two billion, twenty million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •