Base | Representation |
---|---|
bin | 1111100011011101001… |
… | …00111100000001111100 |
3 | 1220002110102102220121221 |
4 | 13301232210330001330 |
5 | 32224003331342112 |
6 | 1045303025403124 |
7 | 53416462403020 |
oct | 7615644740174 |
9 | 1802412386557 |
10 | 534431121532 |
11 | 196718487740 |
12 | 876aba994a4 |
13 | 3b520551479 |
14 | 1bc1bd68380 |
15 | dd7d791e07 |
hex | 7c6e93c07c |
534431121532 has 96 divisors (see below), whose sum is σ = 1235395639296. Its totient is φ = 195848832000.
The previous prime is 534431121493. The next prime is 534431121541. The reversal of 534431121532 is 235121134435.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8540157 + ... + 8602507.
It is an arithmetic number, because the mean of its divisors is an integer number (12868704576).
Almost surely, 2534431121532 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 534431121532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (617697819648).
534431121532 is an abundant number, since it is smaller than the sum of its proper divisors (700964517764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534431121532 is a wasteful number, since it uses less digits than its factorization.
534431121532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64027 (or 64025 counting only the distinct ones).
The product of its digits is 43200, while the sum is 34.
Adding to 534431121532 its reverse (235121134435), we get a palindrome (769552255967).
The spelling of 534431121532 in words is "five hundred thirty-four billion, four hundred thirty-one million, one hundred twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •