Base | Representation |
---|---|
bin | 1111011101101011… |
… | …1110110000010001 |
3 | 101201021220221102111 |
4 | 3313122332300101 |
5 | 32000131421022 |
6 | 1523523145321 |
7 | 204603205261 |
oct | 36732766021 |
9 | 11637827374 |
10 | 4151045137 |
11 | 184017a718 |
12 | 97a215241 |
13 | 511cc8235 |
14 | 2b54317a1 |
15 | 19465e477 |
hex | f76bec11 |
4151045137 has 2 divisors, whose sum is σ = 4151045138. Its totient is φ = 4151045136.
The previous prime is 4151045081. The next prime is 4151045141. The reversal of 4151045137 is 7315401514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3893635201 + 257409936 = 62399^2 + 16044^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4151045137 is a prime.
It is a super-2 number, since 2×41510451372 = 34462351458822697538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4151045099 and 4151045108.
It is not a weakly prime, because it can be changed into another prime (4151045167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2075522568 + 2075522569.
It is an arithmetic number, because the mean of its divisors is an integer number (2075522569).
Almost surely, 24151045137 is an apocalyptic number.
It is an amenable number.
4151045137 is a deficient number, since it is larger than the sum of its proper divisors (1).
4151045137 is an equidigital number, since it uses as much as digits as its factorization.
4151045137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 4151045137 is about 64428.6049592881. The cubic root of 4151045137 is about 1607.1354664412.
The spelling of 4151045137 in words is "four billion, one hundred fifty-one million, forty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •