Base | Representation |
---|---|
bin | 1111010010000000… |
… | …1000111100010001 |
3 | 101120212202112121001 |
4 | 3310200020330101 |
5 | 31400112102222 |
6 | 1515013302001 |
7 | 203436661624 |
oct | 36440107421 |
9 | 11525675531 |
10 | 4102065937 |
11 | 1815566942 |
12 | 965934901 |
13 | 504b09668 |
14 | 2acb21dbb |
15 | 1901d6e27 |
hex | f4808f11 |
4102065937 has 2 divisors, whose sum is σ = 4102065938. Its totient is φ = 4102065936.
The previous prime is 4102065931. The next prime is 4102065943. The reversal of 4102065937 is 7395602014.
It is a balanced prime because it is at equal distance from previous prime (4102065931) and next prime (4102065943).
It can be written as a sum of positive squares in only one way, i.e., 3835201041 + 266864896 = 61929^2 + 16336^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102065937 - 27 = 4102065809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4102065896 and 4102065905.
It is not a weakly prime, because it can be changed into another prime (4102065931) 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 as a sum of consecutive naturals, namely, 2051032968 + 2051032969.
It is an arithmetic number, because the mean of its divisors is an integer number (2051032969).
Almost surely, 24102065937 is an apocalyptic number.
It is an amenable number.
4102065937 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102065937 is an equidigital number, since it uses as much as digits as its factorization.
4102065937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 4102065937 is about 64047.3726002870. The cubic root of 4102065937 is about 1600.7894459672.
The spelling of 4102065937 in words is "four billion, one hundred two million, sixty-five thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •