Base | Representation |
---|---|
bin | 11000001110100111… |
… | …11010010000100001 |
3 | 1020120112000121020201 |
4 | 30013103322100201 |
5 | 203114413434021 |
6 | 5550421105201 |
7 | 640224310405 |
oct | 140723722041 |
9 | 36515017221 |
10 | 13007561761 |
11 | 557547a747 |
12 | 2630258201 |
13 | 12c3b1b80c |
14 | 8b5777105 |
15 | 511e47591 |
hex | 3074fa421 |
13007561761 has 4 divisors (see below), whose sum is σ = 13126897300. Its totient is φ = 12888226224.
The previous prime is 13007561753. The next prime is 13007561767. The reversal of 13007561761 is 16716570031.
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 5122121761 + 7885440000 = 71569^2 + 88800^2 .
It is a cyclic number.
It is not a de Polignac number, because 13007561761 - 23 = 13007561753 is a prime.
It is a super-2 number, since 2×130075617612 (a number of 21 digits) contains 22 as substring.
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 13007561761.
It is not an unprimeable number, because it can be changed into a prime (13007561767) 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, 59667606 + ... + 59667823.
It is an arithmetic number, because the mean of its divisors is an integer number (3281724325).
Almost surely, 213007561761 is an apocalyptic number.
It is an amenable number.
13007561761 is a deficient number, since it is larger than the sum of its proper divisors (119335539).
13007561761 is a wasteful number, since it uses less digits than its factorization.
13007561761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119335538.
The product of its (nonzero) digits is 26460, while the sum is 37.
The spelling of 13007561761 in words is "thirteen billion, seven million, five hundred sixty-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •