Base | Representation |
---|---|
bin | 10111011101110010100010… |
… | …100010110001010001000101 |
3 | 111112102000220211211122101121 |
4 | 113131302202202301101011 |
5 | 102011331102002240343 |
6 | 1003254234155553541 |
7 | 30511053516301063 |
oct | 2735624242612105 |
9 | 445360824748347 |
10 | 103202201211973 |
11 | 2a9798981211a6 |
12 | b6a934045b8b1 |
13 | 4577c0602c1b6 |
14 | 1b6b0282a1033 |
15 | bde7d5843aed |
hex | 5ddca28b1445 |
103202201211973 has 2 divisors, whose sum is σ = 103202201211974. Its totient is φ = 103202201211972.
The previous prime is 103202201211971. The next prime is 103202201212043. The reversal of 103202201211973 is 379112102202301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90389932199044 + 12812269012929 = 9507362^2 + 3579423^2 .
It is a cyclic number.
It is not a de Polignac number, because 103202201211973 - 21 = 103202201211971 is a prime.
It is a super-2 number, since 2×1032022012119732 (a number of 29 digits) contains 22 as substring.
Together with 103202201211971, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103202201211971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51601100605986 + 51601100605987.
It is an arithmetic number, because the mean of its divisors is an integer number (51601100605987).
Almost surely, 2103202201211973 is an apocalyptic number.
It is an amenable number.
103202201211973 is a deficient number, since it is larger than the sum of its proper divisors (1).
103202201211973 is an equidigital number, since it uses as much as digits as its factorization.
103202201211973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9072, while the sum is 34.
The spelling of 103202201211973 in words is "one hundred three trillion, two hundred two billion, two hundred one million, two hundred eleven thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •