Base | Representation |
---|---|
bin | 110000000011111010… |
… | …0000110100110111001 |
3 | 100212101220102012101111 |
4 | 1200013310012212321 |
5 | 3142333320023134 |
6 | 115225243120321 |
7 | 10312435124014 |
oct | 1400764064671 |
9 | 325356365344 |
10 | 103210314169 |
11 | 3a853593706 |
12 | 18004b130a1 |
13 | 996a94cb21 |
14 | 4dd157237b |
15 | 2a40ec3c64 |
hex | 1807d069b9 |
103210314169 has 2 divisors, whose sum is σ = 103210314170. Its totient is φ = 103210314168.
The previous prime is 103210314107. The next prime is 103210314191. The reversal of 103210314169 is 961413012301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103145672569 + 64641600 = 321163^2 + 8040^2 .
It is a cyclic number.
It is not a de Polignac number, because 103210314169 - 213 = 103210305977 is a prime.
It is a super-2 number, since 2×1032103141692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103210314169.
It is not a weakly prime, because it can be changed into another prime (103210312169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51605157084 + 51605157085.
It is an arithmetic number, because the mean of its divisors is an integer number (51605157085).
Almost surely, 2103210314169 is an apocalyptic number.
It is an amenable number.
103210314169 is a deficient number, since it is larger than the sum of its proper divisors (1).
103210314169 is an equidigital number, since it uses as much as digits as its factorization.
103210314169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 103210314169 in words is "one hundred three billion, two hundred ten million, three hundred fourteen thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •