Base | Representation |
---|---|
bin | 1111100011011100000… |
… | …11101111111010000000 |
3 | 1220002102211001212220110 |
4 | 13301232003233322000 |
5 | 32223444114433440 |
6 | 1045302115111320 |
7 | 53416325425260 |
oct | 7615603577200 |
9 | 1802384055813 |
10 | 534422421120 |
11 | 196713584a15 |
12 | 876a8ba2540 |
13 | 3b51b7c62b3 |
14 | 1bc1ab417a0 |
15 | dd7cb24080 |
hex | 7c6e0efe80 |
534422421120 has 512 divisors, whose sum is σ = 2047615303680. Its totient is φ = 115914129408.
The previous prime is 534422421073. The next prime is 534422421151. The reversal of 534422421120 is 21124224435.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 39251434 + ... + 39265046.
It is an arithmetic number, because the mean of its divisors is an integer number (3999248640).
Almost surely, 2534422421120 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 534422421120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1023807651840).
534422421120 is an abundant number, since it is smaller than the sum of its proper divisors (1513192882560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534422421120 is a wasteful number, since it uses less digits than its factorization.
534422421120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13792 (or 13780 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 534422421120 its reverse (21124224435), we get a palindrome (555546645555).
The spelling of 534422421120 in words is "five hundred thirty-four billion, four hundred twenty-two million, four hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •