Base | Representation |
---|---|
bin | 11000011111001100… |
… | …11111100001001101 |
3 | 1020221012202001101221 |
4 | 30033212133201031 |
5 | 203411020310301 |
6 | 10012310203341 |
7 | 643533454462 |
oct | 141746374115 |
9 | 36835661357 |
10 | 13146650701 |
11 | 5636a3a288 |
12 | 266a953551 |
13 | 131689a272 |
14 | 8ca021669 |
15 | 51e26dda1 |
hex | 30f99f84d |
13146650701 has 4 divisors (see below), whose sum is σ = 13146975900. Its totient is φ = 13146325504.
The previous prime is 13146650663. The next prime is 13146650743. The reversal of 13146650701 is 10705664131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10705664131 = 61559 ⋅173909.
It can be written as a sum of positive squares in 2 ways, for example, as 4641015625 + 8505635076 = 68125^2 + 92226^2 .
It is a cyclic number.
It is not a de Polignac number, because 13146650701 - 211 = 13146648653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13146650761) 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, 91636 + ... + 186253.
It is an arithmetic number, because the mean of its divisors is an integer number (3286743975).
Almost surely, 213146650701 is an apocalyptic number.
It is an amenable number.
13146650701 is a deficient number, since it is larger than the sum of its proper divisors (325199).
13146650701 is an equidigital number, since it uses as much as digits as its factorization.
13146650701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325198.
The product of its (nonzero) digits is 15120, while the sum is 34.
The spelling of 13146650701 in words is "thirteen billion, one hundred forty-six million, six hundred fifty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •