Base | Representation |
---|---|
bin | 111000110100100010… |
… | …1011000000001111111 |
3 | 102122221221002222202111 |
4 | 1301221011120001333 |
5 | 3444400124213434 |
6 | 132020045034451 |
7 | 11546551513642 |
oct | 1615105300177 |
9 | 378857088674 |
10 | 122022101119 |
11 | 47827327676 |
12 | 1b794b55a27 |
13 | b6780cc2c9 |
14 | 5c97b15a59 |
15 | 3292781964 |
hex | 1c6915807f |
122022101119 has 4 divisors (see below), whose sum is σ = 122438559096. Its totient is φ = 121605643144.
The previous prime is 122022101107. The next prime is 122022101129. The reversal of 122022101119 is 911101220221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911101220221 = 41 ⋅22221980981.
It is a cyclic number.
It is not a de Polignac number, because 122022101119 - 221 = 122020003967 is a prime.
It is a super-2 number, since 2×1220221011192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122022101119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122022101129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 208228549 + ... + 208229134.
It is an arithmetic number, because the mean of its divisors is an integer number (30609639774).
Almost surely, 2122022101119 is an apocalyptic number.
122022101119 is a deficient number, since it is larger than the sum of its proper divisors (416457977).
122022101119 is an equidigital number, since it uses as much as digits as its factorization.
122022101119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416457976.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 122022101119 in words is "one hundred twenty-two billion, twenty-two million, one hundred one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •