Base | Representation |
---|---|
bin | 110000010001100111… |
… | …0010010001111001101 |
3 | 100220120221200220112202 |
4 | 1200203032102033031 |
5 | 3144304030144011 |
6 | 115343031211245 |
7 | 10330020561242 |
oct | 1404316221715 |
9 | 326527626482 |
10 | 103670162381 |
11 | 3aa6a116455 |
12 | 18112b16b25 |
13 | 9a11cb7266 |
14 | 50366755c9 |
15 | 2a6b55a23b |
hex | 18233923cd |
103670162381 has 2 divisors, whose sum is σ = 103670162382. Its totient is φ = 103670162380.
The previous prime is 103670162377. The next prime is 103670162411. The reversal of 103670162381 is 183261076301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103099430281 + 570732100 = 321091^2 + 23890^2 .
It is an emirp because it is prime and its reverse (183261076301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103670162381 - 22 = 103670162377 is a prime.
It is a super-2 number, since 2×1036701623812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103679162381) 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, 51835081190 + 51835081191.
It is an arithmetic number, because the mean of its divisors is an integer number (51835081191).
Almost surely, 2103670162381 is an apocalyptic number.
It is an amenable number.
103670162381 is a deficient number, since it is larger than the sum of its proper divisors (1).
103670162381 is an equidigital number, since it uses as much as digits as its factorization.
103670162381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 38.
The spelling of 103670162381 in words is "one hundred three billion, six hundred seventy million, one hundred sixty-two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •