Base | Representation |
---|---|
bin | 1110111100011000110… |
… | …11100111111111011101 |
3 | 1211002022201020021112200 |
4 | 13132030123213333131 |
5 | 31403030013111112 |
6 | 1031513504522113 |
7 | 52044642564414 |
oct | 7361433477735 |
9 | 1732281207480 |
10 | 513457160157 |
11 | 1888351aa067 |
12 | 83617920339 |
13 | 3955a155536 |
14 | 1abcc59247b |
15 | d552289cdc |
hex | 778c6e7fdd |
513457160157 has 12 divisors (see below), whose sum is σ = 741675618684. Its totient is φ = 342297722880.
The previous prime is 513457160149. The next prime is 513457160173. The reversal of 513457160157 is 751061754315.
513457160157 is a `hidden beast` number, since 5 + 1 + 3 + 4 + 571 + 60 + 15 + 7 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 117471393081 + 395985767076 = 342741^2 + 629274^2 .
It is not a de Polignac number, because 513457160157 - 23 = 513457160149 is a prime.
It is a super-2 number, since 2×5134571601572 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513457160857) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105508 + ... + 1018845.
It is an arithmetic number, because the mean of its divisors is an integer number (61806301557).
Almost surely, 2513457160157 is an apocalyptic number.
It is an amenable number.
513457160157 is a deficient number, since it is larger than the sum of its proper divisors (228218458527).
513457160157 is a wasteful number, since it uses less digits than its factorization.
513457160157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1175100 (or 1175097 counting only the distinct ones).
The product of its (nonzero) digits is 441000, while the sum is 45.
The spelling of 513457160157 in words is "five hundred thirteen billion, four hundred fifty-seven million, one hundred sixty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •