Base | Representation |
---|---|
bin | 1011000111101101111… |
… | …11111000000011110001 |
3 | 1100112021021120002210111 |
4 | 11203312333320003301 |
5 | 22230020332434443 |
6 | 451311303501321 |
7 | 36414551302636 |
oct | 5436677700361 |
9 | 1315237502714 |
10 | 382101061873 |
11 | 1380590a7253 |
12 | 62078a57841 |
13 | 2a0553339ab |
14 | 146cad6218d |
15 | 9e1535469d |
hex | 58f6ff80f1 |
382101061873 has 2 divisors, whose sum is σ = 382101061874. Its totient is φ = 382101061872.
The previous prime is 382101061847. The next prime is 382101061877. The reversal of 382101061873 is 378160101283.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 259088126049 + 123012935824 = 509007^2 + 350732^2 .
It is an emirp because it is prime and its reverse (378160101283) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 382101061873 - 213 = 382101053681 is a prime.
It is not a weakly prime, because it can be changed into another prime (382101061877) 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, 191050530936 + 191050530937.
It is an arithmetic number, because the mean of its divisors is an integer number (191050530937).
Almost surely, 2382101061873 is an apocalyptic number.
It is an amenable number.
382101061873 is a deficient number, since it is larger than the sum of its proper divisors (1).
382101061873 is an equidigital number, since it uses as much as digits as its factorization.
382101061873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 40.
It can be divided in two parts, 3821010 and 61873, that added together give a palindrome (3882883).
The spelling of 382101061873 in words is "three hundred eighty-two billion, one hundred one million, sixty-one thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •