Base | Representation |
---|---|
bin | 10001100111000000111… |
… | …10110101011011000001 |
3 | 2010211202210011000200111 |
4 | 20303200132311123001 |
5 | 34403131232212321 |
6 | 1141543401551321 |
7 | 61466663515066 |
oct | 10634036653301 |
9 | 2124683130614 |
10 | 605061600961 |
11 | 213672555294 |
12 | 99321aa5541 |
13 | 450984a696c |
14 | 213dc5bcc6d |
15 | 10b143e15e1 |
hex | 8ce07b56c1 |
605061600961 has 4 divisors (see below), whose sum is σ = 636906948400. Its totient is φ = 573216253524.
The previous prime is 605061600959. The next prime is 605061600971. The reversal of 605061600961 is 169006160506.
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 605061600961 - 21 = 605061600959 is a prime.
It is a super-2 number, since 2×6050616009612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (605061600931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15922673691 + ... + 15922673728.
It is an arithmetic number, because the mean of its divisors is an integer number (159226737100).
Almost surely, 2605061600961 is an apocalyptic number.
It is an amenable number.
605061600961 is a deficient number, since it is larger than the sum of its proper divisors (31845347439).
605061600961 is a wasteful number, since it uses less digits than its factorization.
605061600961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31845347438.
The product of its (nonzero) digits is 58320, while the sum is 40.
The spelling of 605061600961 in words is "six hundred five billion, sixty-one million, six hundred thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •