Base | Representation |
---|---|
bin | 1001001001001000100… |
… | …1001001110100000001 |
3 | 120000102112020001220101 |
4 | 2102102021021310001 |
5 | 10033140044230211 |
6 | 200053550042401 |
7 | 14230233612244 |
oct | 2222211116401 |
9 | 500375201811 |
10 | 157070695681 |
11 | 606823494a9 |
12 | 265367a9401 |
13 | 11a72408763 |
14 | 786087125b |
15 | 41447105c1 |
hex | 2492249d01 |
157070695681 has 4 divisors (see below), whose sum is σ = 157136611072. Its totient is φ = 157004780292.
The previous prime is 157070695667. The next prime is 157070695697. The reversal of 157070695681 is 186596070751.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 157070695681 - 213 = 157070687489 is a prime.
It is a super-2 number, since 2×1570706956812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (157070695631) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 32954121 + ... + 32958886.
It is an arithmetic number, because the mean of its divisors is an integer number (39284152768).
Almost surely, 2157070695681 is an apocalyptic number.
It is an amenable number.
157070695681 is a deficient number, since it is larger than the sum of its proper divisors (65915391).
157070695681 is an equidigital number, since it uses as much as digits as its factorization.
157070695681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65915390.
The product of its (nonzero) digits is 3175200, while the sum is 55.
The spelling of 157070695681 in words is "one hundred fifty-seven billion, seventy million, six hundred ninety-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •