Base | Representation |
---|---|
bin | 110000000111111100… |
… | …0001100110001000001 |
3 | 100212202022222201110211 |
4 | 1200033320030301001 |
5 | 3143122433340242 |
6 | 115250514554121 |
7 | 10316000103655 |
oct | 1401770146101 |
9 | 325668881424 |
10 | 103345605697 |
11 | 3a91299a194 |
12 | 18042298941 |
13 | 998c99bc99 |
14 | 500550ca65 |
15 | 2a4ccea317 |
hex | 180fe0cc41 |
103345605697 has 4 divisors (see below), whose sum is σ = 105748991920. Its totient is φ = 100942219476.
The previous prime is 103345605683. The next prime is 103345605721. The reversal of 103345605697 is 796506543301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103345605697 - 27 = 103345605569 is a prime.
It is a super-3 number, since 3×1033456056973 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103345605697.
It is not an unprimeable number, because it can be changed into a prime (103345605637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1201693047 + ... + 1201693132.
It is an arithmetic number, because the mean of its divisors is an integer number (26437247980).
Almost surely, 2103345605697 is an apocalyptic number.
It is an amenable number.
103345605697 is a deficient number, since it is larger than the sum of its proper divisors (2403386223).
103345605697 is an equidigital number, since it uses as much as digits as its factorization.
103345605697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2403386222.
The product of its (nonzero) digits is 2041200, while the sum is 49.
The spelling of 103345605697 in words is "one hundred three billion, three hundred forty-five million, six hundred five thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •