Base | Representation |
---|---|
bin | 10010110001001… |
… | …00000110011001 |
3 | 101222020111012201 |
4 | 21120210012121 |
5 | 310300344030 |
6 | 23342210201 |
7 | 3621112012 |
oct | 1130440631 |
9 | 358214181 |
10 | 157434265 |
11 | 8095a76a |
12 | 44883961 |
13 | 26802991 |
14 | 16ca2009 |
15 | dc4c2ca |
hex | 9624199 |
157434265 has 4 divisors (see below), whose sum is σ = 188921124. Its totient is φ = 125947408.
The previous prime is 157434257. The next prime is 157434269. The reversal of 157434265 is 562434751.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55666521 + 101767744 = 7461^2 + 10088^2 .
It is a cyclic number.
It is not a de Polignac number, because 157434265 - 23 = 157434257 is a prime.
It is a super-3 number, since 3×1574342653 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (157434269) 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 3 ways as a sum of consecutive naturals, for example, 15743422 + ... + 15743431.
It is an arithmetic number, because the mean of its divisors is an integer number (47230281).
Almost surely, 2157434265 is an apocalyptic number.
It is an amenable number.
157434265 is a deficient number, since it is larger than the sum of its proper divisors (31486859).
157434265 is an equidigital number, since it uses as much as digits as its factorization.
157434265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31486858.
The product of its digits is 100800, while the sum is 37.
The square root of 157434265 is about 12547.2811796022. The cubic root of 157434265 is about 539.9660072338.
The spelling of 157434265 in words is "one hundred fifty-seven million, four hundred thirty-four thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •