Base | Representation |
---|---|
bin | 1010110100111101000110… |
… | …1111000111111111001001 |
3 | 1120011002120002011101110121 |
4 | 2231033101233013333021 |
5 | 3030022140012400331 |
6 | 41153005003543241 |
7 | 2336045566206232 |
oct | 255172157077711 |
9 | 46132502141417 |
10 | 11904873168841 |
11 | 387a9125a9674 |
12 | 14032b1b2ab21 |
13 | 684817692703 |
14 | 2d22adc46089 |
15 | 159a16937c11 |
hex | ad3d1bc7fc9 |
11904873168841 has 2 divisors, whose sum is σ = 11904873168842. Its totient is φ = 11904873168840.
The previous prime is 11904873168821. The next prime is 11904873168871. The reversal of 11904873168841 is 14886137840911.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11779797773241 + 125075395600 = 3432171^2 + 353660^2 .
It is an emirp because it is prime and its reverse (14886137840911) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11904873168841 - 221 = 11904871071689 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11904873168841.
It is not a weakly prime, because it can be changed into another prime (11904873168821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5952436584420 + 5952436584421.
It is an arithmetic number, because the mean of its divisors is an integer number (5952436584421).
Almost surely, 211904873168841 is an apocalyptic number.
It is an amenable number.
11904873168841 is a deficient number, since it is larger than the sum of its proper divisors (1).
11904873168841 is an equidigital number, since it uses as much as digits as its factorization.
11904873168841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9289728, while the sum is 61.
The spelling of 11904873168841 in words is "eleven trillion, nine hundred four billion, eight hundred seventy-three million, one hundred sixty-eight thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •