Base | Representation |
---|---|
bin | 11111110010010… |
… | …001010101000000 |
3 | 1101011110000111002 |
4 | 133302101111000 |
5 | 2043004144442 |
6 | 124525511132 |
7 | 16133510330 |
oct | 3762212500 |
9 | 1334400432 |
10 | 533271872 |
11 | 254022061 |
12 | 12a7124a8 |
13 | 866343b3 |
14 | 50b770c0 |
15 | 31c3b732 |
hex | 1fc91540 |
533271872 has 56 divisors (see below), whose sum is σ = 1213567296. Its totient is φ = 227755008.
The previous prime is 533271863. The next prime is 533271881. The reversal of 533271872 is 278172335.
It is an interprime number because it is at equal distance from previous prime (533271863) and next prime (533271881).
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 138323 + ... + 142125.
Almost surely, 2533271872 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 533271872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (606783648).
533271872 is an abundant number, since it is smaller than the sum of its proper divisors (680295424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
533271872 is a wasteful number, since it uses less digits than its factorization.
533271872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4135 (or 4125 counting only the distinct ones).
The product of its digits is 70560, while the sum is 38.
The square root of 533271872 is about 23092.6800523456. The cubic root of 533271872 is about 810.9291131927.
The spelling of 533271872 in words is "five hundred thirty-three million, two hundred seventy-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •