Base | Representation |
---|---|
bin | 111000110100001111… |
… | …0110101111101100101 |
3 | 102122221020002210202201 |
4 | 1301220132311331211 |
5 | 3444340033000401 |
6 | 132015044334501 |
7 | 11546366613625 |
oct | 1615036657545 |
9 | 378836083681 |
10 | 122012000101 |
11 | 47821658622 |
12 | 1b7916a4431 |
13 | b675ca3784 |
14 | 5c96646885 |
15 | 3291938b01 |
hex | 1c687b5f65 |
122012000101 has 4 divisors (see below), whose sum is σ = 125947871104. Its totient is φ = 118076129100.
The previous prime is 122012000083. The next prime is 122012000107. The reversal of 122012000101 is 101000210221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 101000210221 = 47 ⋅2148940643.
It is a cyclic number.
It is not a de Polignac number, because 122012000101 - 213 = 122011991909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122012000107) 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, 1967935455 + ... + 1967935516.
It is an arithmetic number, because the mean of its divisors is an integer number (31486967776).
Almost surely, 2122012000101 is an apocalyptic number.
It is an amenable number.
122012000101 is a deficient number, since it is larger than the sum of its proper divisors (3935871003).
122012000101 is an equidigital number, since it uses as much as digits as its factorization.
122012000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3935871002.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 122012000101 its reverse (101000210221), we get a palindrome (223012210322).
The spelling of 122012000101 in words is "one hundred twenty-two billion, twelve million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •