Base | Representation |
---|---|
bin | 10010110000100… |
… | …01000111100001 |
3 | 101222002112120000 |
4 | 21120101013201 |
5 | 310240402023 |
6 | 23340410213 |
7 | 3620336226 |
oct | 1130210741 |
9 | 358075500 |
10 | 157356513 |
11 | 80907306 |
12 | 44846969 |
13 | 267a6482 |
14 | 16c8194d |
15 | dc34243 |
hex | 96111e1 |
157356513 has 20 divisors (see below), whose sum is σ = 236384148. Its totient is φ = 104315040.
The previous prime is 157356509. The next prime is 157356533. The reversal of 157356513 is 315653751.
157356513 is a `hidden beast` number, since 15 + 73 + 565 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5992704 + 151363809 = 2448^2 + 12303^2 .
It is not a de Polignac number, because 157356513 - 22 = 157356509 is a prime.
It is a super-2 number, since 2×1573565132 = 49522144367038338, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (157356533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9295 + ... + 20027.
Almost surely, 2157356513 is an apocalyptic number.
It is an amenable number.
157356513 is a deficient number, since it is larger than the sum of its proper divisors (79027635).
157356513 is a wasteful number, since it uses less digits than its factorization.
157356513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10926 (or 10917 counting only the distinct ones).
The product of its digits is 47250, while the sum is 36.
The square root of 157356513 is about 12544.1824364922. The cubic root of 157356513 is about 539.8771016614.
The spelling of 157356513 in words is "one hundred fifty-seven million, three hundred fifty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •