Base | Representation |
---|---|
bin | 1111100011100011111… |
… | …00101000101000000000 |
3 | 1220002121100211121220002 |
4 | 13301301330220220000 |
5 | 32224112320241102 |
6 | 1045312405335132 |
7 | 53421050123150 |
oct | 7616174505000 |
9 | 1802540747802 |
10 | 534487665152 |
11 | 196747397801 |
12 | 87706a074a8 |
13 | 3b52c18b12c |
14 | 1bc25686760 |
15 | dd83710902 |
hex | 7c71f28a00 |
534487665152 has 80 divisors (see below), whose sum is σ = 1223328344832. Its totient is φ = 228534005760.
The previous prime is 534487665137. The next prime is 534487665163. The reversal of 534487665152 is 251566784435.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1371698 + ... + 1717710.
Almost surely, 2534487665152 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 534487665152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (611664172416).
534487665152 is an abundant number, since it is smaller than the sum of its proper divisors (688840679680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534487665152 is an equidigital number, since it uses as much as digits as its factorization.
534487665152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346469 (or 346453 counting only the distinct ones).
The product of its digits is 24192000, while the sum is 56.
The spelling of 534487665152 in words is "five hundred thirty-four billion, four hundred eighty-seven million, six hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •