Base | Representation |
---|---|
bin | 1000100001011011111111… |
… | …00000000111101010001001 |
3 | 2110100122000012002101011002 |
4 | 10100231333200013222021 |
5 | 4424023213322020412 |
6 | 103505311200144345 |
7 | 3642666316560041 |
oct | 420557740075211 |
9 | 73318005071132 |
10 | 18741081438857 |
11 | 5a76058990a08 |
12 | 21281923080b5 |
13 | a5c3793212cb |
14 | 48b104b4a721 |
15 | 227772863dc2 |
hex | 110b7f807a89 |
18741081438857 has 2 divisors, whose sum is σ = 18741081438858. Its totient is φ = 18741081438856.
The previous prime is 18741081438811. The next prime is 18741081438899. The reversal of 18741081438857 is 75883418014781.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18734882081161 + 6199357696 = 4328381^2 + 78736^2 .
It is a cyclic number.
It is not a de Polignac number, because 18741081438857 - 228 = 18740813003401 is a prime.
It is a super-2 number, since 2×187410814388572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 18741081438793 and 18741081438802.
It is not a weakly prime, because it can be changed into another prime (18741081038857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9370540719428 + 9370540719429.
It is an arithmetic number, because the mean of its divisors is an integer number (9370540719429).
Almost surely, 218741081438857 is an apocalyptic number.
It is an amenable number.
18741081438857 is a deficient number, since it is larger than the sum of its proper divisors (1).
18741081438857 is an equidigital number, since it uses as much as digits as its factorization.
18741081438857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48168960, while the sum is 65.
The spelling of 18741081438857 in words is "eighteen trillion, seven hundred forty-one billion, eighty-one million, four hundred thirty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •