Base | Representation |
---|---|
bin | 10111100011110111110001… |
… | …001010001000001001001011 |
3 | 111120212222200011022101210102 |
4 | 113203313301022020021023 |
5 | 102040203012241323401 |
6 | 1004214233110440015 |
7 | 30553210316226224 |
oct | 2743676112101113 |
9 | 446788604271712 |
10 | 103620131979851 |
11 | 30020062149923 |
12 | b75633866300b |
13 | 45a844b43a956 |
14 | 1b833539cc24b |
15 | bea5e64bc56b |
hex | 5e3df128824b |
103620131979851 has 2 divisors, whose sum is σ = 103620131979852. Its totient is φ = 103620131979850.
The previous prime is 103620131979781. The next prime is 103620131979853. The reversal of 103620131979851 is 158979131026301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103620131979851 - 210 = 103620131978827 is a prime.
It is a super-3 number, since 3×1036201319798513 (a number of 43 digits) contains 333 as substring.
Together with 103620131979853, 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 (103620131979853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51810065989925 + 51810065989926.
It is an arithmetic number, because the mean of its divisors is an integer number (51810065989926).
Almost surely, 2103620131979851 is an apocalyptic number.
103620131979851 is a deficient number, since it is larger than the sum of its proper divisors (1).
103620131979851 is an equidigital number, since it uses as much as digits as its factorization.
103620131979851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 56.
The spelling of 103620131979851 in words is "one hundred three trillion, six hundred twenty billion, one hundred thirty-one million, nine hundred seventy-nine thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •