Base | Representation |
---|---|
bin | 111101101001011… |
… | …1011001100001001 |
3 | 12100011100122221112 |
4 | 1323102323030021 |
5 | 13214022333401 |
6 | 541132220105 |
7 | 102155313044 |
oct | 17322731411 |
9 | 5304318845 |
10 | 2068558601 |
11 | 97171376a |
12 | 49890a635 |
13 | 26c72ca95 |
14 | 158a23c5b |
15 | c19063bb |
hex | 7b4bb309 |
2068558601 has 4 divisors (see below), whose sum is σ = 2084846592. Its totient is φ = 2052270612.
The previous prime is 2068558573. The next prime is 2068558627. The reversal of 2068558601 is 1068558602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2068558601 - 26 = 2068558537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2068558631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8143805 + ... + 8144058.
It is an arithmetic number, because the mean of its divisors is an integer number (521211648).
Almost surely, 22068558601 is an apocalyptic number.
It is an amenable number.
2068558601 is a deficient number, since it is larger than the sum of its proper divisors (16287991).
2068558601 is a wasteful number, since it uses less digits than its factorization.
2068558601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16287990.
The product of its (nonzero) digits is 115200, while the sum is 41.
The square root of 2068558601 is about 45481.4093998856. The cubic root of 2068558601 is about 1274.1560173324.
Subtracting from 2068558601 its reverse (1068558602), we obtain a palindrome (999999999).
The spelling of 2068558601 in words is "two billion, sixty-eight million, five hundred fifty-eight thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •