Base | Representation |
---|---|
bin | 10010101110101… |
… | …11011000111101 |
3 | 101221122112012112 |
4 | 21113113120331 |
5 | 310210320221 |
6 | 23331343405 |
7 | 3615332660 |
oct | 1127273075 |
9 | 357575175 |
10 | 157120061 |
11 | 8076569a |
12 | 44751b65 |
13 | 26722967 |
14 | 16c1d6d7 |
15 | dbd915b |
hex | 95d763d |
157120061 has 8 divisors (see below), whose sum is σ = 187373184. Its totient is φ = 128818800.
The previous prime is 157120049. The next prime is 157120087. The reversal of 157120061 is 160021751.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-157120061 is a prime.
It is a super-3 number, since 3×1571200613 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157120091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 487790 + ... + 488111.
It is an arithmetic number, because the mean of its divisors is an integer number (23421648).
Almost surely, 2157120061 is an apocalyptic number.
It is an amenable number.
157120061 is a deficient number, since it is larger than the sum of its proper divisors (30253123).
157120061 is an equidigital number, since it uses as much as digits as its factorization.
157120061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975931.
The product of its (nonzero) digits is 420, while the sum is 23.
The square root of 157120061 is about 12534.7541260290. The cubic root of 157120061 is about 539.6065503895.
The spelling of 157120061 in words is "one hundred fifty-seven million, one hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •