Base | Representation |
---|---|
bin | 1100001000100011100110… |
… | …0011100011010001011001 |
3 | 1202020101210120101101222002 |
4 | 3002020321203203101121 |
5 | 3222040120303322301 |
6 | 44212455443010345 |
7 | 2544602511203240 |
oct | 302107143432131 |
9 | 52211716341862 |
10 | 13341134042201 |
11 | 4283a41400799 |
12 | 15b57269699b5 |
13 | 75a0a97a9064 |
14 | 341a001b5957 |
15 | 18207818a16b |
hex | c22398e3459 |
13341134042201 has 8 divisors (see below), whose sum is σ = 15258931384320. Its totient is φ = 11426316962688.
The previous prime is 13341134042179. The next prime is 13341134042219. The reversal of 13341134042201 is 10224043114331.
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 13341134042201 - 210 = 13341134041177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13341134042101) 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 7 ways as a sum of consecutive naturals, for example, 745056056 + ... + 745073961.
It is an arithmetic number, because the mean of its divisors is an integer number (1907366423040).
Almost surely, 213341134042201 is an apocalyptic number.
It is an amenable number.
13341134042201 is a deficient number, since it is larger than the sum of its proper divisors (1917797342119).
13341134042201 is a wasteful number, since it uses less digits than its factorization.
13341134042201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1490131303.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 13341134042201 its reverse (10224043114331), we get a palindrome (23565177156532).
The spelling of 13341134042201 in words is "thirteen trillion, three hundred forty-one billion, one hundred thirty-four million, forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •