Base | Representation |
---|---|
bin | 1100000110010110101010… |
… | …1110101100101000011001 |
3 | 1202002210011011010112011011 |
4 | 3001211222232230220121 |
5 | 3220430131402421131 |
6 | 44143241553133521 |
7 | 2542063166102230 |
oct | 301455256545031 |
9 | 52083134115134 |
10 | 13303304342041 |
11 | 426999953708a |
12 | 15aa32985a2a1 |
13 | 75665b2597ac |
14 | 33dc51d53b17 |
15 | 1810b1ea50b1 |
hex | c196abaca19 |
13303304342041 has 8 divisors (see below), whose sum is σ = 16003975148480. Its totient is φ = 10802683225008.
The previous prime is 13303304342039. The next prime is 13303304342093. The reversal of 13303304342041 is 14024340330331.
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 13303304342041 - 21 = 13303304342039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13303304341994 and 13303304342012.
It is not an unprimeable number, because it can be changed into a prime (13303304342021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50012422206 + ... + 50012422471.
It is an arithmetic number, because the mean of its divisors is an integer number (2000496893560).
Almost surely, 213303304342041 is an apocalyptic number.
It is an amenable number.
13303304342041 is a deficient number, since it is larger than the sum of its proper divisors (2700670806439).
13303304342041 is a wasteful number, since it uses less digits than its factorization.
13303304342041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100024844703.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 13303304342041 its reverse (14024340330331), we get a palindrome (27327644672372).
The spelling of 13303304342041 in words is "thirteen trillion, three hundred three billion, three hundred four million, three hundred forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •