Base | Representation |
---|---|
bin | 1100100000000000111011… |
… | …0101000101100101011011 |
3 | 1210122221001000222211100210 |
4 | 3020000032311011211123 |
5 | 3300141001400112411 |
6 | 45121550032102203 |
7 | 2615660463434340 |
oct | 310001665054533 |
9 | 53587030884323 |
10 | 13744144144731 |
11 | 441994a073730 |
12 | 165b85a094963 |
13 | 7890b4928050 |
14 | 3573120507c7 |
15 | 18c7b3e70ca6 |
hex | c800ed4595b |
13744144144731 has 64 divisors (see below), whose sum is σ = 25269898945536. Its totient is φ = 6412474252800.
The previous prime is 13744144144699. The next prime is 13744144144781.
13744144144731 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13744144144731 - 25 = 13744144144699 is a prime.
It is a super-2 number, since 2×137441441447312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13744144144781) 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 63 ways as a sum of consecutive naturals, for example, 61737600 + ... + 61959821.
It is an arithmetic number, because the mean of its divisors is an integer number (394842171024).
Almost surely, 213744144144731 is an apocalyptic number.
13744144144731 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13744144144731 is a deficient number, since it is larger than the sum of its proper divisors (11525754800805).
13744144144731 is a wasteful number, since it uses less digits than its factorization.
13744144144731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123697492.
The product of its digits is 1806336, while the sum is 48.
The spelling of 13744144144731 in words is "thirteen trillion, seven hundred forty-four billion, one hundred forty-four million, one hundred forty-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •