Base | Representation |
---|---|
bin | 1100011010000110100001… |
… | …0000101101000001110101 |
3 | 1210022012211211112221221222 |
4 | 3012201220100231001311 |
5 | 3242004433211410201 |
6 | 45003150305520125 |
7 | 2605433326030361 |
oct | 306415020550165 |
9 | 53265754487858 |
10 | 13642565341301 |
11 | 438a863524206 |
12 | 164402b643045 |
13 | 77c646cc47c0 |
14 | 3524374562a1 |
15 | 189d1b32291b |
hex | c686842d075 |
13642565341301 has 8 divisors (see below), whose sum is σ = 14941010283360. Its totient is φ = 12379694233392.
The previous prime is 13642565341291. The next prime is 13642565341313. The reversal of 13642565341301 is 10314356524631.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13642565341301 is a prime.
It is a super-2 number, since 2×136425653413012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13642565341331) 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, 8893457735 + ... + 8893459268.
It is an arithmetic number, because the mean of its divisors is an integer number (1867626285420).
Almost surely, 213642565341301 is an apocalyptic number.
It is an amenable number.
13642565341301 is a deficient number, since it is larger than the sum of its proper divisors (1298444942059).
13642565341301 is a wasteful number, since it uses less digits than its factorization.
13642565341301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17786917075.
The product of its (nonzero) digits is 777600, while the sum is 44.
The spelling of 13642565341301 in words is "thirteen trillion, six hundred forty-two billion, five hundred sixty-five million, three hundred forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •