Base | Representation |
---|---|
bin | 11011110001000111000101… |
… | …100101010010001000100011 |
3 | 121000101202112111222021120220 |
4 | 123301013011211102020203 |
5 | 112001322100210343243 |
6 | 1111422043305334123 |
7 | 34503013656521454 |
oct | 3361070545221043 |
9 | 530352474867526 |
10 | 122122120012323 |
11 | 35a03778036812 |
12 | 11844102a97343 |
13 | 531b0b3152162 |
14 | 2222a5664112b |
15 | e1ba237a5783 |
hex | 6f11c5952223 |
122122120012323 has 8 divisors (see below), whose sum is σ = 162864204409536. Its totient is φ = 81397391145000.
The previous prime is 122122120012301. The next prime is 122122120012391. The reversal of 122122120012323 is 323210021221221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122122120012323 - 233 = 122113530077731 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122122120012293 and 122122120012302.
It is not an unprimeable number, because it can be changed into a prime (122122120012223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4338866053 + ... + 4338894198.
It is an arithmetic number, because the mean of its divisors is an integer number (20358025551192).
Almost surely, 2122122120012323 is an apocalyptic number.
122122120012323 is a deficient number, since it is larger than the sum of its proper divisors (40742084397213).
122122120012323 is an equidigital number, since it uses as much as digits as its factorization.
122122120012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8677764945.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 122122120012323 its reverse (323210021221221), we get a palindrome (445332141233544).
The spelling of 122122120012323 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, one hundred twenty million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •