Base | Representation |
---|---|
bin | 11000111011101001… |
… | …11101101100010001 |
3 | 1021112211211222102222 |
4 | 30131310331230101 |
5 | 204403120402304 |
6 | 10052113550425 |
7 | 652462250045 |
oct | 143564755421 |
9 | 37484758388 |
10 | 13385325329 |
11 | 5749738042 |
12 | 2716875415 |
13 | 1354175a5c |
14 | 90d9d0025 |
15 | 5351b74be |
hex | 31dd3db11 |
13385325329 has 4 divisors (see below), whose sum is σ = 13440866340. Its totient is φ = 13329784320.
The previous prime is 13385325311. The next prime is 13385325337. The reversal of 13385325329 is 92352358331.
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 9105548929 + 4279776400 = 95423^2 + 65420^2 .
It is a cyclic number.
It is not a de Polignac number, because 13385325329 - 28 = 13385325073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13385325329.
It is not an unprimeable number, because it can be changed into a prime (13385325829) 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, 27770144 + ... + 27770625.
It is an arithmetic number, because the mean of its divisors is an integer number (3360216585).
Almost surely, 213385325329 is an apocalyptic number.
It is an amenable number.
13385325329 is a deficient number, since it is larger than the sum of its proper divisors (55541011).
13385325329 is an equidigital number, since it uses as much as digits as its factorization.
13385325329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55541010.
The product of its digits is 583200, while the sum is 44.
The spelling of 13385325329 in words is "thirteen billion, three hundred eighty-five million, three hundred twenty-five thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •