Base | Representation |
---|---|
bin | 100001111101000101101… |
… | …0001000110101000001101 |
3 | 121112010111022210110220112 |
4 | 1003322023101012220031 |
5 | 1102424320234000302 |
6 | 13531501123125405 |
7 | 661104313003502 |
oct | 103721321065015 |
9 | 17463438713815 |
10 | 4666671000077 |
11 | 153a140135329 |
12 | 634522813865 |
13 | 27b0b02a6538 |
14 | 121c220314a9 |
15 | 815ce058552 |
hex | 43e8b446a0d |
4666671000077 has 2 divisors, whose sum is σ = 4666671000078. Its totient is φ = 4666671000076.
The previous prime is 4666670999891. The next prime is 4666671000083. The reversal of 4666671000077 is 7700001766664.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3274757117641 + 1391913882436 = 1809629^2 + 1179794^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4666671000077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4666670999989 and 4666671000034.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4666671090077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2333335500038 + 2333335500039.
It is an arithmetic number, because the mean of its divisors is an integer number (2333335500039).
Almost surely, 24666671000077 is an apocalyptic number.
It is an amenable number.
4666671000077 is a deficient number, since it is larger than the sum of its proper divisors (1).
4666671000077 is an equidigital number, since it uses as much as digits as its factorization.
4666671000077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1778112, while the sum is 50.
The spelling of 4666671000077 in words is "four trillion, six hundred sixty-six billion, six hundred seventy-one million, seventy-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •