Base | Representation |
---|---|
bin | 111000110100100000… |
… | …1100110100011001101 |
3 | 102122221212020201221221 |
4 | 1301221001212203031 |
5 | 3444344401041023 |
6 | 132020011523341 |
7 | 11546540224153 |
oct | 1615101464315 |
9 | 378855221857 |
10 | 122021112013 |
11 | 47826811529 |
12 | 1b794759551 |
13 | b677b44038 |
14 | 5c979393d3 |
15 | 329263885d |
hex | 1c690668cd |
122021112013 has 4 divisors (see below), whose sum is σ = 122653345948. Its totient is φ = 121388878080.
The previous prime is 122021111969. The next prime is 122021112023. The reversal of 122021112013 is 310211120221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 65269008484 + 56752103529 = 255478^2 + 238227^2 .
It is a cyclic number.
It is not a de Polignac number, because 122021112013 - 29 = 122021111501 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 (122021112023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 316116678 + ... + 316117063.
It is an arithmetic number, because the mean of its divisors is an integer number (30663336487).
Almost surely, 2122021112013 is an apocalyptic number.
It is an amenable number.
122021112013 is a deficient number, since it is larger than the sum of its proper divisors (632233935).
122021112013 is an equidigital number, since it uses as much as digits as its factorization.
122021112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632233934.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 122021112013 its reverse (310211120221), we get a palindrome (432232232234).
The spelling of 122021112013 in words is "one hundred twenty-two billion, twenty-one million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •