Base | Representation |
---|---|
bin | 1111011111110100000… |
… | …10011110100011100101 |
3 | 1212220102011101221020100 |
4 | 13233322002132203211 |
5 | 32211002314241403 |
6 | 1044341023054313 |
7 | 53320151506446 |
oct | 7577202364345 |
9 | 1786364357210 |
10 | 532475930853 |
11 | 195904865a79 |
12 | 87245141399 |
13 | 3b29b4659c9 |
14 | 1bab44152cd |
15 | dcb6cd12a3 |
hex | 7bfa09e8e5 |
532475930853 has 12 divisors (see below), whose sum is σ = 769625269920. Its totient is φ = 354756244776.
The previous prime is 532475930839. The next prime is 532475930873. The reversal of 532475930853 is 358039574235.
532475930853 is a `hidden beast` number, since 5 + 3 + 2 + 47 + 593 + 0 + 8 + 5 + 3 = 666.
It is not a de Polignac number, because 532475930853 - 24 = 532475930837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 532475930853.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (532475930873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18960951 + ... + 18989012.
It is an arithmetic number, because the mean of its divisors is an integer number (64135439160).
Almost surely, 2532475930853 is an apocalyptic number.
It is an amenable number.
532475930853 is a deficient number, since it is larger than the sum of its proper divisors (237149339067).
532475930853 is a wasteful number, since it uses less digits than its factorization.
532475930853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37951528 (or 37951525 counting only the distinct ones).
The product of its (nonzero) digits is 13608000, while the sum is 54.
The spelling of 532475930853 in words is "five hundred thirty-two billion, four hundred seventy-five million, nine hundred thirty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •