Base | Representation |
---|---|
bin | 10001101000110110110… |
… | …01110010100110010101 |
3 | 2010221022200020201122212 |
4 | 20310123121302212111 |
5 | 34412142313300141 |
6 | 1142225433403205 |
7 | 61533326100614 |
oct | 10643331624625 |
9 | 2127280221585 |
10 | 606050134421 |
11 | 21402a557096 |
12 | 99558b69505 |
13 | 451c522a8c4 |
14 | 214939c387b |
15 | 10b710aa2eb |
hex | 8d1b672995 |
606050134421 has 2 divisors, whose sum is σ = 606050134422. Its totient is φ = 606050134420.
The previous prime is 606050134411. The next prime is 606050134451. The reversal of 606050134421 is 124431050606.
606050134421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 586250548900 + 19799585521 = 765670^2 + 140711^2 .
It is a cyclic number.
It is not a de Polignac number, because 606050134421 - 218 = 606049872277 is a prime.
It is a super-3 number, since 3×6060501344213 (a number of 36 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (606050134411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 303025067210 + 303025067211.
It is an arithmetic number, because the mean of its divisors is an integer number (303025067211).
Almost surely, 2606050134421 is an apocalyptic number.
It is an amenable number.
606050134421 is a deficient number, since it is larger than the sum of its proper divisors (1).
606050134421 is an equidigital number, since it uses as much as digits as its factorization.
606050134421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 606050134421 in words is "six hundred six billion, fifty million, one hundred thirty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •