Base | Representation |
---|---|
bin | 10001101010110110110… |
… | …01101101101011110001 |
3 | 2011001002111122102220221 |
4 | 20311123121231223301 |
5 | 34421342201343423 |
6 | 1142524151133041 |
7 | 61602044425555 |
oct | 10653331555361 |
9 | 2131074572827 |
10 | 607123856113 |
11 | 214530653095 |
12 | 997b8674181 |
13 | 4533680a598 |
14 | 21556441865 |
15 | 10bd549ee5d |
hex | 8d5b66daf1 |
607123856113 has 4 divisors (see below), whose sum is σ = 607134478320. Its totient is φ = 607113233908.
The previous prime is 607123856111. The next prime is 607123856149. The reversal of 607123856113 is 311658321706.
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 607123856113 - 21 = 607123856111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 607123856113.
It is not an unprimeable number, because it can be changed into a prime (607123856111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5224903 + ... + 5339836.
It is an arithmetic number, because the mean of its divisors is an integer number (151783619580).
Almost surely, 2607123856113 is an apocalyptic number.
It is an amenable number.
607123856113 is a deficient number, since it is larger than the sum of its proper divisors (10622207).
607123856113 is a wasteful number, since it uses less digits than its factorization.
607123856113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10622206.
The product of its (nonzero) digits is 181440, while the sum is 43.
The spelling of 607123856113 in words is "six hundred seven billion, one hundred twenty-three million, eight hundred fifty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •