Base | Representation |
---|---|
bin | 10001101110010001000… |
… | …11111001100100111001 |
3 | 2011012211010201112011211 |
4 | 20313020203321210321 |
5 | 34434120020232214 |
6 | 1143430012123121 |
7 | 61665323105434 |
oct | 10671043714471 |
9 | 2135733645154 |
10 | 608955242809 |
11 | 2152903a5011 |
12 | 9a029a664a1 |
13 | 45569069854 |
14 | 2168b76881b |
15 | 10c911580c4 |
hex | 8dc88f9939 |
608955242809 has 4 divisors (see below), whose sum is σ = 609535754100. Its totient is φ = 608374731520.
The previous prime is 608955242789. The next prime is 608955242849. The reversal of 608955242809 is 908242559806.
608955242809 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 429094432809 + 179860810000 = 655053^2 + 424100^2 .
It is a cyclic number.
It is not a de Polignac number, because 608955242809 - 29 = 608955242297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (608955242849) 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, 290254072 + ... + 290256169.
It is an arithmetic number, because the mean of its divisors is an integer number (152383938525).
Almost surely, 2608955242809 is an apocalyptic number.
It is an amenable number.
608955242809 is a deficient number, since it is larger than the sum of its proper divisors (580511291).
608955242809 is a wasteful number, since it uses less digits than its factorization.
608955242809 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 580511290.
The product of its (nonzero) digits is 12441600, while the sum is 58.
The spelling of 608955242809 in words is "six hundred eight billion, nine hundred fifty-five million, two hundred forty-two thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •