Base | Representation |
---|---|
bin | 111001000111111010… |
… | …010010000010011001 |
3 | 12212022121111202221012 |
4 | 321013322102002121 |
5 | 2001104004041323 |
6 | 44102151223305 |
7 | 4300651264226 |
oct | 710772220231 |
9 | 185277452835 |
10 | 61336002713 |
11 | 24015635737 |
12 | ba79377b35 |
13 | 5a2648c43b |
14 | 2d7c0a694d |
15 | 18deba5678 |
hex | e47e92099 |
61336002713 has 4 divisors (see below), whose sum is σ = 61783710900. Its totient is φ = 60888294528.
The previous prime is 61336002671. The next prime is 61336002719. The reversal of 61336002713 is 31720063316.
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 17352265984 + 43983736729 = 131728^2 + 209723^2 .
It is a cyclic number.
It is not a de Polignac number, because 61336002713 - 214 = 61335986329 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 61336002713.
It is not an unprimeable number, because it can be changed into a prime (61336002719) 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, 223853888 + ... + 223854161.
It is an arithmetic number, because the mean of its divisors is an integer number (15445927725).
Almost surely, 261336002713 is an apocalyptic number.
It is an amenable number.
61336002713 is a deficient number, since it is larger than the sum of its proper divisors (447708187).
61336002713 is a wasteful number, since it uses less digits than its factorization.
61336002713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447708186.
The product of its (nonzero) digits is 13608, while the sum is 32.
The spelling of 61336002713 in words is "sixty-one billion, three hundred thirty-six million, two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •