Base | Representation |
---|---|
bin | 11100000010100100101111… |
… | …111100010110100010000001 |
3 | 121011122111011011210110011112 |
4 | 130002210233330112202001 |
5 | 112131002331240221004 |
6 | 1114141234155253105 |
7 | 34655510042032166 |
oct | 3402445774264201 |
9 | 534574134713145 |
10 | 123322200320129 |
11 | 36326719094298 |
12 | 119b880344a195 |
13 | 53a7306277375 |
14 | 2264b7d6b206d |
15 | e3cd60555e6e |
hex | 70292ff16881 |
123322200320129 has 2 divisors, whose sum is σ = 123322200320130. Its totient is φ = 123322200320128.
The previous prime is 123322200320093. The next prime is 123322200320149. The reversal of 123322200320129 is 921023002223321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93629291545729 + 29692908774400 = 9676223^2 + 5449120^2 .
It is a cyclic number.
It is not a de Polignac number, because 123322200320129 - 28 = 123322200319873 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 123322200320095 and 123322200320104.
It is not a weakly prime, because it can be changed into another prime (123322200320149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61661100160064 + 61661100160065.
It is an arithmetic number, because the mean of its divisors is an integer number (61661100160065).
Almost surely, 2123322200320129 is an apocalyptic number.
It is an amenable number.
123322200320129 is a deficient number, since it is larger than the sum of its proper divisors (1).
123322200320129 is an equidigital number, since it uses as much as digits as its factorization.
123322200320129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 123322200320129 in words is "one hundred twenty-three trillion, three hundred twenty-two billion, two hundred million, three hundred twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •