Base | Representation |
---|---|
bin | 100010101011111011001110… |
… | …0001011011010000010000101 |
3 | 1111000021200022010101221201102 |
4 | 1011113312130023122002011 |
5 | 304442311411240314421 |
6 | 3000522535014305445 |
7 | 121160023541124161 |
oct | 10527663413320205 |
9 | 1430250263357642 |
10 | 305104212041861 |
11 | 89240a73713511 |
12 | 2a2772a7358285 |
13 | 1013228580c57b |
14 | 554b1a07cbca1 |
15 | 25416d9e7760b |
hex | 1157d9c2da085 |
305104212041861 has 2 divisors, whose sum is σ = 305104212041862. Its totient is φ = 305104212041860.
The previous prime is 305104212041833. The next prime is 305104212041879. The reversal of 305104212041861 is 168140212401503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 180677013808225 + 124427198233636 = 13441615^2 + 11154694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-305104212041861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (305104212043861) 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, 152552106020930 + 152552106020931.
It is an arithmetic number, because the mean of its divisors is an integer number (152552106020931).
Almost surely, 2305104212041861 is an apocalyptic number.
It is an amenable number.
305104212041861 is a deficient number, since it is larger than the sum of its proper divisors (1).
305104212041861 is an equidigital number, since it uses as much as digits as its factorization.
305104212041861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 38.
The spelling of 305104212041861 in words is "three hundred five trillion, one hundred four billion, two hundred twelve million, forty-one thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •