Base | Representation |
---|---|
bin | 10001101000110110110… |
… | …01110010100101010101 |
3 | 2010221022200020201120111 |
4 | 20310123121302211111 |
5 | 34412142313244412 |
6 | 1142225433403021 |
7 | 61533326100463 |
oct | 10643331624525 |
9 | 2127280221514 |
10 | 606050134357 |
11 | 21402a557038 |
12 | 99558b69471 |
13 | 451c522a875 |
14 | 214939c3833 |
15 | 10b710aa2a7 |
hex | 8d1b672955 |
606050134357 has 4 divisors (see below), whose sum is σ = 622429867756. Its totient is φ = 589670400960.
The previous prime is 606050134309. The next prime is 606050134369. The reversal of 606050134357 is 753431050606.
606050134357 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 346637160081 + 259412974276 = 588759^2 + 509326^2 .
It is a cyclic number.
It is not a de Polignac number, because 606050134357 - 215 = 606050101589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (606050104357) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8189866644 + ... + 8189866717.
It is an arithmetic number, because the mean of its divisors is an integer number (155607466939).
Almost surely, 2606050134357 is an apocalyptic number.
It is an amenable number.
606050134357 is a deficient number, since it is larger than the sum of its proper divisors (16379733399).
606050134357 is a wasteful number, since it uses less digits than its factorization.
606050134357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16379733398.
The product of its (nonzero) digits is 226800, while the sum is 40.
The spelling of 606050134357 in words is "six hundred six billion, fifty million, one hundred thirty-four thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •