Base | Representation |
---|---|
bin | 110000000110101011… |
… | …0001011010000001001 |
3 | 100212122101001211202012 |
4 | 1200031112023100021 |
5 | 3143031100212134 |
6 | 115242400345305 |
7 | 10314643064306 |
oct | 1401526132011 |
9 | 325571054665 |
10 | 103303132169 |
11 | 3a8a0a1a1a6 |
12 | 18030015235 |
13 | 9983c4a613 |
14 | 4ddda140ad |
15 | 2a4920a6ce |
hex | 180d58b409 |
103303132169 has 2 divisors, whose sum is σ = 103303132170. Its totient is φ = 103303132168.
The previous prime is 103303132133. The next prime is 103303132171. The reversal of 103303132169 is 961231303301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100798630144 + 2504502025 = 317488^2 + 50045^2 .
It is a cyclic number.
It is not a de Polignac number, because 103303132169 - 28 = 103303131913 is a prime.
It is a super-2 number, since 2×1033031321692 (a number of 23 digits) contains 22 as substring.
Together with 103303132171, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (103303134169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51651566084 + 51651566085.
It is an arithmetic number, because the mean of its divisors is an integer number (51651566085).
Almost surely, 2103303132169 is an apocalyptic number.
It is an amenable number.
103303132169 is a deficient number, since it is larger than the sum of its proper divisors (1).
103303132169 is an equidigital number, since it uses as much as digits as its factorization.
103303132169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 32.
It can be divided in two parts, 103303132 and 169, that added together give a palindrome (103303301).
The spelling of 103303132169 in words is "one hundred three billion, three hundred three million, one hundred thirty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •