Base | Representation |
---|---|
bin | 11011110010010010110010… |
… | …010001010111100001011010 |
3 | 121000200112100002100221110001 |
4 | 123302102302101113201122 |
5 | 112004140031000344114 |
6 | 1111523244522243214 |
7 | 34511622116452546 |
oct | 3362226221274132 |
9 | 530615302327401 |
10 | 122203400403034 |
11 | 35a35197767335 |
12 | 11857a0765650a |
13 | 53259676175c2 |
14 | 2226967474a26 |
15 | e1dbce38e374 |
hex | 6f24b245785a |
122203400403034 has 4 divisors (see below), whose sum is σ = 183305100604554. Its totient is φ = 61101700201516.
The previous prime is 122203400403011. The next prime is 122203400403037. The reversal of 122203400403034 is 430304004302221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 120546894978225 + 1656505424809 = 10979385^2 + 1287053^2 .
It is a junction number, because it is equal to n+sod(n) for n = 122203400402993 and 122203400403011.
It is not an unprimeable number, because it can be changed into a prime (122203400403037) 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, 30550850100757 + ... + 30550850100760.
Almost surely, 2122203400403034 is an apocalyptic number.
122203400403034 is a deficient number, since it is larger than the sum of its proper divisors (61101700201520).
122203400403034 is an equidigital number, since it uses as much as digits as its factorization.
122203400403034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61101700201519.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 122203400403034 its reverse (430304004302221), we get a palindrome (552507404705255).
The spelling of 122203400403034 in words is "one hundred twenty-two trillion, two hundred three billion, four hundred million, four hundred three thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •