Base | Representation |
---|---|
bin | 10010110010100… |
… | …01101110001101 |
3 | 101222120222112202 |
4 | 21121101232031 |
5 | 310322334013 |
6 | 23350211245 |
7 | 3622520555 |
oct | 1131215615 |
9 | 358528482 |
10 | 157621133 |
11 | 80a780aa |
12 | 44953b25 |
13 | 26869a57 |
14 | 16d10165 |
15 | dc87858 |
hex | 9651b8d |
157621133 has 8 divisors (see below), whose sum is σ = 160406400. Its totient is φ = 154842480.
The previous prime is 157621129. The next prime is 157621153. The reversal of 157621133 is 331126751.
157621133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 157621133 - 22 = 157621129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 157621096 and 157621105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157621153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84416 + ... + 86262.
It is an arithmetic number, because the mean of its divisors is an integer number (20050800).
Almost surely, 2157621133 is an apocalyptic number.
It is an amenable number.
157621133 is a deficient number, since it is larger than the sum of its proper divisors (2785267).
157621133 is a wasteful number, since it uses less digits than its factorization.
157621133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3307.
The product of its digits is 3780, while the sum is 29.
The square root of 157621133 is about 12554.7255246779. The cubic root of 157621133 is about 540.1795619129.
Adding to 157621133 its reverse (331126751), we get a palindrome (488747884).
The spelling of 157621133 in words is "one hundred fifty-seven million, six hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •