Base | Representation |
---|---|
bin | 1111011111110011… |
… | …1110010010101101 |
3 | 101201220200200000200 |
4 | 3313330332102231 |
5 | 32004422044031 |
6 | 1524442144113 |
7 | 205042021005 |
oct | 36774762255 |
9 | 11656620020 |
10 | 4159956141 |
11 | 1845206690 |
12 | 9811b2039 |
13 | 513ac8213 |
14 | 2b66b1005 |
15 | 19531e8e6 |
hex | f7f3e4ad |
4159956141 has 12 divisors (see below), whose sum is σ = 6555082560. Its totient is φ = 2521185480.
The previous prime is 4159956133. The next prime is 4159956169. The reversal of 4159956141 is 1416599514.
4159956141 is a `hidden beast` number, since 4 + 1 + 599 + 56 + 1 + 4 + 1 = 666.
It is not a de Polignac number, because 4159956141 - 23 = 4159956133 is a prime.
It is a super-2 number, since 2×41599561412 = 34610470190087223762, which contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4159956131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21009781 + ... + 21009978.
It is an arithmetic number, because the mean of its divisors is an integer number (546256880).
Almost surely, 24159956141 is an apocalyptic number.
It is an amenable number.
4159956141 is a deficient number, since it is larger than the sum of its proper divisors (2395126419).
4159956141 is a wasteful number, since it uses less digits than its factorization.
4159956141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42019776 (or 42019773 counting only the distinct ones).
The product of its digits is 194400, while the sum is 45.
The square root of 4159956141 is about 64497.7219830282. The cubic root of 4159956141 is about 1608.2846513321.
The spelling of 4159956141 in words is "four billion, one hundred fifty-nine million, nine hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •