Base | Representation |
---|---|
bin | 100000000000011… |
… | …101000011010100 |
3 | 1101102102220200010 |
4 | 200000131003110 |
5 | 2044432134113 |
6 | 125141320220 |
7 | 16210224150 |
oct | 4000350324 |
9 | 1342386603 |
10 | 536989908 |
11 | 256131514 |
12 | 12ba06070 |
13 | 87336810 |
14 | 51464060 |
15 | 322231c3 |
hex | 2001d0d4 |
536989908 has 96 divisors (see below), whose sum is σ = 1546562304. Its totient is φ = 141216768.
The previous prime is 536989907. The next prime is 536989933. The reversal of 536989908 is 809989635.
It is a super-2 number, since 2×5369899082 = 576716322587696928, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (536989903) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 673366 + ... + 674162.
It is an arithmetic number, because the mean of its divisors is an integer number (16110024).
Almost surely, 2536989908 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 536989908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (773281152).
536989908 is an abundant number, since it is smaller than the sum of its proper divisors (1009572396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
536989908 is a wasteful number, since it uses less digits than its factorization.
536989908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1441 (or 1439 counting only the distinct ones).
The product of its (nonzero) digits is 4199040, while the sum is 57.
The square root of 536989908 is about 23173.0427005173. The cubic root of 536989908 is about 812.8093820766.
The spelling of 536989908 in words is "five hundred thirty-six million, nine hundred eighty-nine thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •