Base | Representation |
---|---|
bin | 11011110100001001000100… |
… | …111100000111000101011101 |
3 | 121001010200011221222202110211 |
4 | 123310021010330013011131 |
5 | 112013230142233224041 |
6 | 1112101452240532421 |
7 | 34524036504034024 |
oct | 3364110474070535 |
9 | 531120157882424 |
10 | 122330415133021 |
11 | 35a84046216967 |
12 | 11878554621111 |
13 | 5334929b94374 |
14 | 222cb7628d8bb |
15 | e221650bd481 |
hex | 6f4244f0715d |
122330415133021 has 32 divisors (see below), whose sum is σ = 125866637769600. Its totient is φ = 118822060062720.
The previous prime is 122330415133019. The next prime is 122330415133037. The reversal of 122330415133021 is 120331514033221.
It is not a de Polignac number, because 122330415133021 - 21 = 122330415133019 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 (122330415133921) 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 in 31 ways as a sum of consecutive naturals, for example, 14901983365 + ... + 14901991573.
It is an arithmetic number, because the mean of its divisors is an integer number (3933332430300).
Almost surely, 2122330415133021 is an apocalyptic number.
It is an amenable number.
122330415133021 is a deficient number, since it is larger than the sum of its proper divisors (3536222636579).
122330415133021 is an equidigital number, since it uses as much as digits as its factorization.
122330415133021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10429.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 122330415133021 its reverse (120331514033221), we get a palindrome (242661929166242).
The spelling of 122330415133021 in words is "one hundred twenty-two trillion, three hundred thirty billion, four hundred fifteen million, one hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •