Base | Representation |
---|---|
bin | 1110111011110100010… |
… | …01101000110101101110 |
3 | 1211001112100010001100222 |
4 | 13131322021220311232 |
5 | 31401413004031100 |
6 | 1031423231051342 |
7 | 52034226620624 |
oct | 7357211506556 |
9 | 1731470101328 |
10 | 513150455150 |
11 | 188698066053 |
12 | 83551070b52 |
13 | 3950b74a898 |
14 | 1ab9d955514 |
15 | d5353a4485 |
hex | 777a268d6e |
513150455150 has 12 divisors (see below), whose sum is σ = 954459846672. Its totient is φ = 205260182040.
The previous prime is 513150455137. The next prime is 513150455161. The reversal of 513150455150 is 51554051315.
It is a self number, because there is not a number n which added to its sum of digits gives 513150455150.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5131504502 + ... + 5131504601.
It is an arithmetic number, because the mean of its divisors is an integer number (79538320556).
Almost surely, 2513150455150 is an apocalyptic number.
513150455150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
513150455150 is a deficient number, since it is larger than the sum of its proper divisors (441309391522).
513150455150 is a wasteful number, since it uses less digits than its factorization.
513150455150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10263009115 (or 10263009110 counting only the distinct ones).
The product of its (nonzero) digits is 37500, while the sum is 35.
The spelling of 513150455150 in words is "five hundred thirteen billion, one hundred fifty million, four hundred fifty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •