Base | Representation |
---|---|
bin | 1100100101100110010001… |
… | …1100000011110110111101 |
3 | 1211000002122020212012020210 |
4 | 3021121210130003312331 |
5 | 3303223430321031044 |
6 | 45234012405503033 |
7 | 2625624554312262 |
oct | 311314434036675 |
9 | 54002566765223 |
10 | 13840069705149 |
11 | 44565a45a1a96 |
12 | 167636b411a79 |
13 | 79516128189c |
14 | 35bc11d01269 |
15 | 19002a62e1b9 |
hex | c9664703dbd |
13840069705149 has 32 divisors (see below), whose sum is σ = 19439583306880. Its totient is φ = 8749161734400.
The previous prime is 13840069705141. The next prime is 13840069705151. The reversal of 13840069705149 is 94150796004831.
It is a happy number.
It is not a de Polignac number, because 13840069705149 - 23 = 13840069705141 is a prime.
It is a super-2 number, since 2×138400697051492 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13840069705141) 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 31 ways as a sum of consecutive naturals, for example, 8638207 + ... + 10114284.
It is an arithmetic number, because the mean of its divisors is an integer number (607486978340).
Almost surely, 213840069705149 is an apocalyptic number.
It is an amenable number.
13840069705149 is a deficient number, since it is larger than the sum of its proper divisors (5599513601731).
13840069705149 is a wasteful number, since it uses less digits than its factorization.
13840069705149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18752701.
The product of its (nonzero) digits is 6531840, while the sum is 57.
The spelling of 13840069705149 in words is "thirteen trillion, eight hundred forty billion, sixty-nine million, seven hundred five thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •