Base | Representation |
---|---|
bin | 11111110011001… |
… | …001000001110100 |
3 | 1101011212121110000 |
4 | 133303021001310 |
5 | 2043034000040 |
6 | 124534431300 |
7 | 16135450434 |
oct | 3763110164 |
9 | 1334777400 |
10 | 533500020 |
11 | 254168509 |
12 | 12a802530 |
13 | 866b41b1 |
14 | 50bd62c4 |
15 | 31c84130 |
hex | 1fcc9074 |
533500020 has 60 divisors (see below), whose sum is σ = 1673614404. Its totient is φ = 142266240.
The previous prime is 533499977. The next prime is 533500021. The reversal of 533500020 is 20005335.
It can be written as a sum of positive squares in 2 ways, for example, as 243547236 + 289952784 = 15606^2 + 17028^2 .
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 533499966 and 533500002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (533500021) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 163041 + ... + 166280.
Almost surely, 2533500020 is an apocalyptic number.
It is an amenable number.
533500020 is an abundant number, since it is smaller than the sum of its proper divisors (1140114384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
533500020 is a wasteful number, since it uses less digits than its factorization.
533500020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329342 (or 329331 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 18.
The square root of 533500020 is about 23097.6193578472. The cubic root of 533500020 is about 811.0447424411.
Adding to 533500020 its reverse (20005335), we get a palindrome (553505355).
The spelling of 533500020 in words is "five hundred thirty-three million, five hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •