Base | Representation |
---|---|
bin | 111000110100011111… |
… | …0100111111101011001 |
3 | 102122221210210002002121 |
4 | 1301220332213331121 |
5 | 3444344201100403 |
6 | 132015543101241 |
7 | 11546530463164 |
oct | 1615076477531 |
9 | 378853702077 |
10 | 122020331353 |
11 | 47826328a58 |
12 | 1b794441821 |
13 | b67792c8cb |
14 | 5c977b4adb |
15 | 32925323bd |
hex | 1c68fa7f59 |
122020331353 has 2 divisors, whose sum is σ = 122020331354. Its totient is φ = 122020331352.
The previous prime is 122020331347. The next prime is 122020331371. The reversal of 122020331353 is 353133020221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121419493209 + 600838144 = 348453^2 + 24512^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122020331353 is a prime.
It is a super-2 number, since 2×1220203313532 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122020331453) 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 as a sum of consecutive naturals, namely, 61010165676 + 61010165677.
It is an arithmetic number, because the mean of its divisors is an integer number (61010165677).
Almost surely, 2122020331353 is an apocalyptic number.
It is an amenable number.
122020331353 is a deficient number, since it is larger than the sum of its proper divisors (1).
122020331353 is an equidigital number, since it uses as much as digits as its factorization.
122020331353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 25.
Adding to 122020331353 its reverse (353133020221), we get a palindrome (475153351574).
The spelling of 122020331353 in words is "one hundred twenty-two billion, twenty million, three hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.195 sec. • engine limits •