Base | Representation |
---|---|
bin | 1110100000111010… |
… | …1100010101101101 |
3 | 101001112022201121212 |
4 | 3220032230111231 |
5 | 30434404300431 |
6 | 1442340204205 |
7 | 165356601536 |
oct | 35016542555 |
9 | 11045281555 |
10 | 3896165741 |
11 | 171a313a96 |
12 | 908999665 |
13 | 4a1267920 |
14 | 28d64568d |
15 | 17c0b472b |
hex | e83ac56d |
3896165741 has 8 divisors (see below), whose sum is σ = 4197463200. Its totient is φ = 3595095792.
The previous prime is 3896165677. The next prime is 3896165743. The reversal of 3896165741 is 1475616983.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3896165741 - 26 = 3896165677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3896165741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3896165743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20435 + ... + 90608.
It is an arithmetic number, because the mean of its divisors is an integer number (524682900).
Almost surely, 23896165741 is an apocalyptic number.
It is an amenable number.
3896165741 is a deficient number, since it is larger than the sum of its proper divisors (301297459).
3896165741 is a wasteful number, since it uses less digits than its factorization.
3896165741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113755.
The product of its digits is 1088640, while the sum is 50.
The square root of 3896165741 is about 62419.2737942376. The cubic root of 3896165741 is about 1573.5449049912.
The spelling of 3896165741 in words is "three billion, eight hundred ninety-six million, one hundred sixty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •