Base | Representation |
---|---|
bin | 1110111100001011001… |
… | …01101100111110111100 |
3 | 1211002000201012220102202 |
4 | 13132011211230332330 |
5 | 31402311121032112 |
6 | 1031454244211032 |
7 | 52042050035510 |
oct | 7360545547674 |
9 | 1732021186382 |
10 | 513342361532 |
11 | 188786420170 |
12 | 835a5399a78 |
13 | 3953c42cc60 |
14 | 1abbb22c140 |
15 | d5471606c2 |
hex | 778596cfbc |
513342361532 has 192 divisors, whose sum is σ = 1275393638400. Its totient is φ = 174111793920.
The previous prime is 513342361501. The next prime is 513342361549. The reversal of 513342361532 is 235163243315.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a congruent number.
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, 16949819 + ... + 16980077.
It is an arithmetic number, because the mean of its divisors is an integer number (6642675200).
Almost surely, 2513342361532 is an apocalyptic number.
513342361532 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 513342361532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (637696819200).
513342361532 is an abundant number, since it is smaller than the sum of its proper divisors (762051276868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
513342361532 is a wasteful number, since it uses less digits than its factorization.
513342361532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30536 (or 30534 counting only the distinct ones).
The product of its digits is 194400, while the sum is 38.
The spelling of 513342361532 in words is "five hundred thirteen billion, three hundred forty-two million, three hundred sixty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •