Base | Representation |
---|---|
bin | 1111010000100101… |
… | …1111010000111101 |
3 | 101120110120212100201 |
4 | 3310021133100331 |
5 | 31342102044221 |
6 | 1514242123501 |
7 | 203335341214 |
oct | 36411372075 |
9 | 11513525321 |
10 | 4096128061 |
11 | 1812180703 |
12 | 963950591 |
13 | 50380aa1c |
14 | 2ac01807b |
15 | 18e912891 |
hex | f425f43d |
4096128061 has 2 divisors, whose sum is σ = 4096128062. Its totient is φ = 4096128060.
The previous prime is 4096127993. The next prime is 4096128077. The reversal of 4096128061 is 1608216904.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3364696036 + 731432025 = 58006^2 + 27045^2 .
It is a cyclic number.
It is not a de Polignac number, because 4096128061 - 29 = 4096127549 is a prime.
It is a super-2 number, since 2×40961280612 = 33556530184223239442, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4096128061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4096122061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2048064030 + 2048064031.
It is an arithmetic number, because the mean of its divisors is an integer number (2048064031).
Almost surely, 24096128061 is an apocalyptic number.
It is an amenable number.
4096128061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4096128061 is an equidigital number, since it uses as much as digits as its factorization.
4096128061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 4096128061 is about 64001.0004687427. Note that the first 3 decimals coincide. The cubic root of 4096128061 is about 1600.0166744356.
The spelling of 4096128061 in words is "four billion, ninety-six million, one hundred twenty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •