Base | Representation |
---|---|
bin | 11000110101010110… |
… | …11001011100000101 |
3 | 1021102011102110100211 |
4 | 30122223121130011 |
5 | 204301104022033 |
6 | 10042545235421 |
7 | 651251155156 |
oct | 143253313405 |
9 | 37364373324 |
10 | 13332485893 |
11 | 5721927a91 |
12 | 2701032b71 |
13 | 134623510c |
14 | 90699792d |
15 | 53072b2cd |
hex | 31aad9705 |
13332485893 has 2 divisors, whose sum is σ = 13332485894. Its totient is φ = 13332485892.
The previous prime is 13332485891. The next prime is 13332485899. The reversal of 13332485893 is 39858423331.
It is a happy number.
13332485893 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13058318529 + 274167364 = 114273^2 + 16558^2 .
It is a cyclic number.
It is not a de Polignac number, because 13332485893 - 21 = 13332485891 is a prime.
Together with 13332485891, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13332485891) by changing a digit.
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 as a sum of consecutive naturals, namely, 6666242946 + 6666242947.
It is an arithmetic number, because the mean of its divisors is an integer number (6666242947).
Almost surely, 213332485893 is an apocalyptic number.
It is an amenable number.
13332485893 is a deficient number, since it is larger than the sum of its proper divisors (1).
13332485893 is an equidigital number, since it uses as much as digits as its factorization.
13332485893 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1866240, while the sum is 49.
The spelling of 13332485893 in words is "thirteen billion, three hundred thirty-two million, four hundred eighty-five thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •