Base | Representation |
---|---|
bin | 111010011000001110001010… |
… | …0101111111001000010000000 |
3 | 2111100011100022012010201011110 |
4 | 1310300130110233321002000 |
5 | 1014301210244304304102 |
6 | 5020043415245043320 |
7 | 213106214521222503 |
oct | 16460342457710200 |
9 | 2440140265121143 |
10 | 513502343041152 |
11 | 139688136739503 |
12 | 4971423b856540 |
13 | 1906b0a8a31b4a |
14 | 90b390893913a |
15 | 3e5759373c86c |
hex | 1d30714bf9080 |
513502343041152 has 32 divisors (see below), whose sum is σ = 1363990598704080. Its totient is φ = 171167447680256.
The previous prime is 513502343041123. The next prime is 513502343041157. The reversal of 513502343041152 is 251140343205315.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 513502343041152.
It is not an unprimeable number, because it can be changed into a prime (513502343041157) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 668622842118 + ... + 668622842885.
Almost surely, 2513502343041152 is an apocalyptic number.
It is an amenable number.
513502343041152 is an abundant number, since it is smaller than the sum of its proper divisors (850488255662928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
513502343041152 is a wasteful number, since it uses less digits than its factorization.
513502343041152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1337245685020 (or 1337245685008 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 513502343041152 its reverse (251140343205315), we get a palindrome (764642686246467).
The spelling of 513502343041152 in words is "five hundred thirteen trillion, five hundred two billion, three hundred forty-three million, forty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •