Base | Representation |
---|---|
bin | 11000001110001100… |
… | …11000010001000101 |
3 | 1020120021100101112122 |
4 | 30013012120101011 |
5 | 203113011432121 |
6 | 5550213055325 |
7 | 640152205121 |
oct | 140706302105 |
9 | 36507311478 |
10 | 13004014661 |
11 | 5573477760 |
12 | 262b027545 |
13 | 12c3179141 |
14 | 8b50d2581 |
15 | 5119965ab |
hex | 307198445 |
13004014661 has 16 divisors (see below), whose sum is σ = 14496226560. Its totient is φ = 11563759680.
The previous prime is 13004014603. The next prime is 13004014687. The reversal of 13004014661 is 16641040031.
It is not a de Polignac number, because 13004014661 - 214 = 13003998277 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 13004014661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13004014601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1063595 + ... + 1075751.
It is an arithmetic number, because the mean of its divisors is an integer number (906014160).
Almost surely, 213004014661 is an apocalyptic number.
13004014661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13004014661 is a deficient number, since it is larger than the sum of its proper divisors (1492211899).
13004014661 is a wasteful number, since it uses less digits than its factorization.
13004014661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14284.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 13004014661 its reverse (16641040031), we get a palindrome (29645054692).
The spelling of 13004014661 in words is "thirteen billion, four million, fourteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •