Base | Representation |
---|---|
bin | 11000110100011110… |
… | …11000001100011101 |
3 | 1021101122121021202001 |
4 | 30122033120030131 |
5 | 204242214001030 |
6 | 10042124002301 |
7 | 651131553616 |
oct | 143217301435 |
9 | 37348537661 |
10 | 13325140765 |
11 | 5718770532 |
12 | 26ba690391 |
13 | 1344862aa1 |
14 | 905a04c0d |
15 | 52ec79cca |
hex | 31a3d831d |
13325140765 has 4 divisors (see below), whose sum is σ = 15990168924. Its totient is φ = 10660112608.
The previous prime is 13325140757. The next prime is 13325140789. The reversal of 13325140765 is 56704152331.
13325140765 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 6965237764 + 6359903001 = 83458^2 + 79749^2 .
It is a cyclic number.
It is not a de Polignac number, because 13325140765 - 23 = 13325140757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1332514072 + ... + 1332514081.
It is an arithmetic number, because the mean of its divisors is an integer number (3997542231).
Almost surely, 213325140765 is an apocalyptic number.
It is an amenable number.
13325140765 is a deficient number, since it is larger than the sum of its proper divisors (2665028159).
13325140765 is an equidigital number, since it uses as much as digits as its factorization.
13325140765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2665028158.
The product of its (nonzero) digits is 75600, while the sum is 37.
The spelling of 13325140765 in words is "thirteen billion, three hundred twenty-five million, one hundred forty thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •