Base | Representation |
---|---|
bin | 1011110110100101000111… |
… | …0011000111101011000001 |
3 | 1201010212122121112121212221 |
4 | 2331221101303013223001 |
5 | 3202010124100200304 |
6 | 43414542444451041 |
7 | 2513360422603006 |
oct | 275512163075301 |
9 | 51125577477787 |
10 | 13032303131329 |
11 | 4174a72403449 |
12 | 15658b7b49a81 |
13 | 736c30250a01 |
14 | 330aa42b58ad |
15 | 1790005a0054 |
hex | bda51cc7ac1 |
13032303131329 has 8 divisors (see below), whose sum is σ = 13107828045312. Its totient is φ = 12956780443920.
The previous prime is 13032303131273. The next prime is 13032303131347. The reversal of 13032303131329 is 92313130323031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13032303131329 - 217 = 13032303000257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13032303131294 and 13032303131303.
It is not an unprimeable number, because it can be changed into a prime (13032303131359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12001894 + ... + 13042624.
It is an arithmetic number, because the mean of its divisors is an integer number (1638478505664).
Almost surely, 213032303131329 is an apocalyptic number.
It is an amenable number.
13032303131329 is a deficient number, since it is larger than the sum of its proper divisors (75524913983).
13032303131329 is a wasteful number, since it uses less digits than its factorization.
13032303131329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1113287.
The product of its (nonzero) digits is 26244, while the sum is 34.
The spelling of 13032303131329 in words is "thirteen trillion, thirty-two billion, three hundred three million, one hundred thirty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •