Base | Representation |
---|---|
bin | 100001100011010011… |
… | …111001000000000001 |
3 | 10102222201002012000001 |
4 | 201203103321000001 |
5 | 1042240112200321 |
6 | 24314452000001 |
7 | 2413520033365 |
oct | 414323710001 |
9 | 112881065001 |
10 | 36025896961 |
11 | 1430775266a |
12 | 6b95000001 |
13 | 352192a3c2 |
14 | 1a5a8792a5 |
15 | e0cb79c91 |
hex | 8634f9001 |
36025896961 has 4 divisors (see below), whose sum is σ = 37268169300. Its totient is φ = 34783624624.
The previous prime is 36025896947. The next prime is 36025896971. The reversal of 36025896961 is 16969852063.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16969852063 = 191 ⋅88847393.
It can be written as a sum of positive squares in 2 ways, for example, as 10387482561 + 25638414400 = 101919^2 + 160120^2 .
It is a cyclic number.
It is not a de Polignac number, because 36025896961 - 229 = 35489026049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (36025896971) 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 in 3 ways as a sum of consecutive naturals, for example, 621136126 + ... + 621136183.
It is an arithmetic number, because the mean of its divisors is an integer number (9317042325).
Almost surely, 236025896961 is an apocalyptic number.
It is an amenable number.
36025896961 is a deficient number, since it is larger than the sum of its proper divisors (1242272339).
36025896961 is a wasteful number, since it uses less digits than its factorization.
36025896961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242272338.
The product of its (nonzero) digits is 4199040, while the sum is 55.
The spelling of 36025896961 in words is "thirty-six billion, twenty-five million, eight hundred ninety-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •