Base | Representation |
---|---|
bin | 11000010101000100… |
… | …01001011001000101 |
3 | 1020201021202022122012 |
4 | 30022202021121011 |
5 | 203222234003123 |
6 | 10000031544005 |
7 | 641451661364 |
oct | 141242113105 |
9 | 36637668565 |
10 | 13061625413 |
11 | 55a2a46551 |
12 | 264638b005 |
13 | 130209a745 |
14 | 8bca0b7db |
15 | 516a76378 |
hex | 30a889645 |
13061625413 has 4 divisors (see below), whose sum is σ = 13062976320. Its totient is φ = 13060274508.
The previous prime is 13061625397. The next prime is 13061625431. The reversal of 13061625413 is 31452616031.
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 13061625413 - 24 = 13061625397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13061625413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13061625443) 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 3 ways as a sum of consecutive naturals, for example, 660845 + ... + 680322.
It is an arithmetic number, because the mean of its divisors is an integer number (3265744080).
Almost surely, 213061625413 is an apocalyptic number.
It is an amenable number.
13061625413 is a deficient number, since it is larger than the sum of its proper divisors (1350907).
13061625413 is an equidigital number, since it uses as much as digits as its factorization.
13061625413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1350906.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 13061625413 in words is "thirteen billion, sixty-one million, six hundred twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •