Base | Representation |
---|---|
bin | 11001000010110001… |
… | …01001111100111001 |
3 | 1021201000011102221202 |
4 | 30201120221330321 |
5 | 210013410411210 |
6 | 10102045143545 |
7 | 654115504343 |
oct | 144130517471 |
9 | 37630142852 |
10 | 13445013305 |
11 | 577a3a5549 |
12 | 273285abb5 |
13 | 1363643999 |
14 | 9178ca293 |
15 | 53a5579a5 |
hex | 321629f39 |
13445013305 has 4 divisors (see below), whose sum is σ = 16134015972. Its totient is φ = 10756010640.
The previous prime is 13445013277. The next prime is 13445013313. The reversal of 13445013305 is 50331054431.
13445013305 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 7763019664 + 5681993641 = 88108^2 + 75379^2 .
It is not a de Polignac number, because 13445013305 - 212 = 13445009209 is a prime.
It is a Duffinian 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, 1344501326 + ... + 1344501335.
It is an arithmetic number, because the mean of its divisors is an integer number (4033503993).
Almost surely, 213445013305 is an apocalyptic number.
It is an amenable number.
13445013305 is a deficient number, since it is larger than the sum of its proper divisors (2689002667).
13445013305 is an equidigital number, since it uses as much as digits as its factorization.
13445013305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2689002666.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 13445013305 its reverse (50331054431), we get a palindrome (63776067736).
The spelling of 13445013305 in words is "thirteen billion, four hundred forty-five million, thirteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •