Base | Representation |
---|---|
bin | 111000110100011111… |
… | …0001111100010000101 |
3 | 102122221210120222211222 |
4 | 1301220332033202011 |
5 | 3444344134400201 |
6 | 132015541010125 |
7 | 11546526565403 |
oct | 1615076174205 |
9 | 378853528758 |
10 | 122020231301 |
11 | 4782626a871 |
12 | 1b7943b3945 |
13 | b6778c61c7 |
14 | 5c9778a473 |
15 | 329251291b |
hex | 1c68f8f885 |
122020231301 has 2 divisors, whose sum is σ = 122020231302. Its totient is φ = 122020231300.
The previous prime is 122020231253. The next prime is 122020231309. The reversal of 122020231301 is 103132020221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113888700676 + 8131530625 = 337474^2 + 90175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122020231301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122020231301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122020231309) 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 as a sum of consecutive naturals, namely, 61010115650 + 61010115651.
It is an arithmetic number, because the mean of its divisors is an integer number (61010115651).
Almost surely, 2122020231301 is an apocalyptic number.
It is an amenable number.
122020231301 is a deficient number, since it is larger than the sum of its proper divisors (1).
122020231301 is an equidigital number, since it uses as much as digits as its factorization.
122020231301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 122020231301 its reverse (103132020221), we get a palindrome (225152251522).
The spelling of 122020231301 in words is "one hundred twenty-two billion, twenty million, two hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •