Base | Representation |
---|---|
bin | 10100001011101110111… |
… | …101110100110111001101 |
3 | 11220121001121211221021020 |
4 | 110023232331310313031 |
5 | 140211023043412104 |
6 | 2541101312224353 |
7 | 202130605015536 |
oct | 24135675646715 |
9 | 4817047757236 |
10 | 1386988654029 |
11 | 495244a33500 |
12 | 1a498383b0b9 |
13 | a0a3c091aa4 |
14 | 4b1b856968d |
15 | 2612ac1b2d9 |
hex | 142eef74dcd |
1386988654029 has 36 divisors (see below), whose sum is σ = 2121265446048. Its totient is φ = 803989010880.
The previous prime is 1386988654027. The next prime is 1386988654069. The reversal of 1386988654029 is 9204568896831.
It is not a de Polignac number, because 1386988654029 - 21 = 1386988654027 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (69).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1386988654027) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 107603817 + ... + 107616705.
It is an arithmetic number, because the mean of its divisors is an integer number (58924040168).
Almost surely, 21386988654029 is an apocalyptic number.
It is an amenable number.
1386988654029 is a deficient number, since it is larger than the sum of its proper divisors (734276792019).
1386988654029 is an frugal number, since it uses more digits than its factorization.
1386988654029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25826 (or 12926 counting only the distinct ones).
The product of its (nonzero) digits is 179159040, while the sum is 69.
Multiplying 1386988654029 by its sum of digits (69), we get a square (95702217128001 = 97827512).
1386988654029 divided by its sum of digits (69) gives a square (20101284841 = 1417792).
The spelling of 1386988654029 in words is "one trillion, three hundred eighty-six billion, nine hundred eighty-eight million, six hundred fifty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •