Base | Representation |
---|---|
bin | 11000100110001010… |
… | …01111011110011101 |
3 | 1021002021121200201102 |
4 | 30103011033132131 |
5 | 204020442334401 |
6 | 10022153522445 |
7 | 645143004635 |
oct | 142305173635 |
9 | 37067550642 |
10 | 13205043101 |
11 | 56669a2368 |
12 | 2686413425 |
13 | 1325a03593 |
14 | 8d3aa16c5 |
15 | 52445556b |
hex | 31314f79d |
13205043101 has 4 divisors (see below), whose sum is σ = 13335786204. Its totient is φ = 13074300000.
The previous prime is 13205043079. The next prime is 13205043113. The reversal of 13205043101 is 10134050231.
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 12940200025 + 264843076 = 113755^2 + 16274^2 .
It is a cyclic number.
It is not a de Polignac number, because 13205043101 - 26 = 13205043037 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 (13205043191) 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, 65371400 + ... + 65371601.
It is an arithmetic number, because the mean of its divisors is an integer number (3333946551).
Almost surely, 213205043101 is an apocalyptic number.
It is an amenable number.
13205043101 is a deficient number, since it is larger than the sum of its proper divisors (130743103).
13205043101 is a wasteful number, since it uses less digits than its factorization.
13205043101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130743102.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 13205043101 its reverse (10134050231), we get a palindrome (23339093332).
The spelling of 13205043101 in words is "thirteen billion, two hundred five million, forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •