Base | Representation |
---|---|
bin | 100110001001… |
… | …0111100010100 |
3 | 1101122010120110 |
4 | 1030102330110 |
5 | 20110004112 |
6 | 1552403020 |
7 | 332000406 |
oct | 114227424 |
9 | 41563513 |
10 | 20000532 |
11 | 10320772 |
12 | 6846470 |
13 | 41b3746 |
14 | 2928b76 |
15 | 1b5113c |
hex | 1312f14 |
20000532 has 12 divisors (see below), whose sum is σ = 46667936. Its totient is φ = 6666840.
The previous prime is 20000531. The next prime is 20000537. The reversal of 20000532 is 23500002.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 1666711 = 20000532 / (2 + 0 + 0 + 0 + 0 + 5 + 3 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 833344 + ... + 833367.
Almost surely, 220000532 is an apocalyptic number.
It is an amenable number.
20000532 is an abundant number, since it is smaller than the sum of its proper divisors (26667404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000532 is a wasteful number, since it uses less digits than its factorization.
20000532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1666718 (or 1666716 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 12.
The square root of 20000532 is about 4472.1954340122. The cubic root of 20000532 is about 271.4441684218. Note that the first 3 decimals are identical.
Adding to 20000532 its reverse (23500002), we get a palindrome (43500534).
The spelling of 20000532 in words is "twenty million, five hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •