Base | Representation |
---|---|
bin | 10010110000111… |
… | …01000000111101 |
3 | 101222012000101220 |
4 | 21120131000331 |
5 | 310243431440 |
6 | 23341423553 |
7 | 3620631264 |
oct | 1130350075 |
9 | 358160356 |
10 | 157405245 |
11 | 8093a988 |
12 | 4486abb9 |
13 | 267c26ca |
14 | 16c955db |
15 | dc438d0 |
hex | 961d03d |
157405245 has 8 divisors (see below), whose sum is σ = 251848416. Its totient is φ = 83949456.
The previous prime is 157405231. The next prime is 157405309. The reversal of 157405245 is 542504751.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 157405245 - 26 = 157405181 is a prime.
It is a super-2 number, since 2×1574052452 = 49552822307020050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5246827 + ... + 5246856.
It is an arithmetic number, because the mean of its divisors is an integer number (31481052).
Almost surely, 2157405245 is an apocalyptic number.
157405245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
157405245 is a deficient number, since it is larger than the sum of its proper divisors (94443171).
157405245 is a wasteful number, since it uses less digits than its factorization.
157405245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10493691.
The product of its (nonzero) digits is 28000, while the sum is 33.
The square root of 157405245 is about 12546.1247004802. The cubic root of 157405245 is about 539.9328277214.
Adding to 157405245 its reverse (542504751), we get a palindrome (699909996).
The spelling of 157405245 in words is "one hundred fifty-seven million, four hundred five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •