Base | Representation |
---|---|
bin | 101001010101001… |
… | …1000010000110101 |
3 | 10120122120211101201 |
4 | 1102222120100311 |
5 | 10320012404031 |
6 | 345340452501 |
7 | 46236645430 |
oct | 12252302065 |
9 | 3518524351 |
10 | 1386841141 |
11 | 651921304 |
12 | 32854a131 |
13 | 19142217a |
14 | d2288817 |
15 | 81b45d61 |
hex | 52a98435 |
1386841141 has 32 divisors (see below), whose sum is σ = 1768939520. Its totient is φ = 1060257600.
The previous prime is 1386841139. The next prime is 1386841151. The reversal of 1386841141 is 1411486831.
It is a cyclic number.
It is not a de Polignac number, because 1386841141 - 21 = 1386841139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a deceptive number, since it divides R1386841140.
It is a self number, because there is not a number n which added to its sum of digits gives 1386841141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1386841111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 148006 + ... + 157096.
It is an arithmetic number, because the mean of its divisors is an integer number (55279360).
Almost surely, 21386841141 is an apocalyptic number.
It is an amenable number.
1386841141 is a deficient number, since it is larger than the sum of its proper divisors (382098379).
1386841141 is a wasteful number, since it uses less digits than its factorization.
1386841141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9185.
The product of its digits is 18432, while the sum is 37.
The square root of 1386841141 is about 37240.3160700873. The cubic root of 1386841141 is about 1115.1729818023.
The spelling of 1386841141 in words is "one billion, three hundred eighty-six million, eight hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •