Base | Representation |
---|---|
bin | 11100000010011100010111… |
… | …011111010111010000110011 |
3 | 121011121121220221100120200211 |
4 | 130002130113133113100303 |
5 | 112130330413213230141 |
6 | 1114133145130124551 |
7 | 34655041024512106 |
oct | 3402342737272063 |
9 | 534547827316624 |
10 | 123313200133171 |
11 | 3632291a785654 |
12 | 119b6b11280757 |
13 | 53a650075cc59 |
14 | 226456824c73d |
15 | e3c9d533dd81 |
hex | 7027177d7433 |
123313200133171 has 2 divisors, whose sum is σ = 123313200133172. Its totient is φ = 123313200133170.
The previous prime is 123313200133163. The next prime is 123313200133217. The reversal of 123313200133171 is 171331002313321.
It is a weak prime.
It is an emirp because it is prime and its reverse (171331002313321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123313200133171 - 23 = 123313200133163 is a prime.
It is a super-2 number, since 2×1233132001331712 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (123313200133111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61656600066585 + 61656600066586.
It is an arithmetic number, because the mean of its divisors is an integer number (61656600066586).
Almost surely, 2123313200133171 is an apocalyptic number.
123313200133171 is a deficient number, since it is larger than the sum of its proper divisors (1).
123313200133171 is an equidigital number, since it uses as much as digits as its factorization.
123313200133171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 31.
Adding to 123313200133171 its reverse (171331002313321), we get a palindrome (294644202446492).
The spelling of 123313200133171 in words is "one hundred twenty-three trillion, three hundred thirteen billion, two hundred million, one hundred thirty-three thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •