Base | Representation |
---|---|
bin | 110101000101001… |
… | …000011010110100 |
3 | 2022001201000000000 |
4 | 311011020122310 |
5 | 3310434201102 |
6 | 224211151300 |
7 | 31032305454 |
oct | 6505103264 |
9 | 2261630000 |
10 | 890537652 |
11 | 41775a134 |
12 | 20a2a5530 |
13 | 112662774 |
14 | 863b5d64 |
15 | 532ad01c |
hex | 351486b4 |
890537652 has 60 divisors (see below), whose sum is σ = 2337828416. Its totient is φ = 296819640.
The previous prime is 890537633. The next prime is 890537653. The reversal of 890537652 is 256735098.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 890537598 and 890537607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (890537653) 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 19 ways as a sum of consecutive naturals, for example, 73077 + ... + 84387.
Almost surely, 2890537652 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 890537652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1168914208).
890537652 is an abundant number, since it is smaller than the sum of its proper divisors (1447290764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
890537652 is an equidigital number, since it uses as much as digits as its factorization.
890537652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11342 (or 11316 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 45.
The square root of 890537652 is about 29841.8774878525. The cubic root of 890537652 is about 962.0938283287.
The spelling of 890537652 in words is "eight hundred ninety million, five hundred thirty-seven thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •