Base | Representation |
---|---|
bin | 1001001001001100110… |
… | …0000001011000100001 |
3 | 120000110202012122100001 |
4 | 2102103030001120201 |
5 | 10033204041143201 |
6 | 200055413500001 |
7 | 14230535610454 |
oct | 2222314013041 |
9 | 500422178301 |
10 | 157088224801 |
11 | 60691231382 |
12 | 26540641601 |
13 | 11a75c35311 |
14 | 7862d1549b |
15 | 4146024301 |
hex | 2493301621 |
157088224801 has 2 divisors, whose sum is σ = 157088224802. Its totient is φ = 157088224800.
The previous prime is 157088224721. The next prime is 157088224817. The reversal of 157088224801 is 108422880751.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141872755600 + 15215469201 = 376660^2 + 123351^2 .
It is an emirp because it is prime and its reverse (108422880751) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 157088224801 - 213 = 157088216609 is a prime.
It is a super-2 number, since 2×1570882248012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (157088224841) 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 as a sum of consecutive naturals, namely, 78544112400 + 78544112401.
It is an arithmetic number, because the mean of its divisors is an integer number (78544112401).
Almost surely, 2157088224801 is an apocalyptic number.
It is an amenable number.
157088224801 is a deficient number, since it is larger than the sum of its proper divisors (1).
157088224801 is an equidigital number, since it uses as much as digits as its factorization.
157088224801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 286720, while the sum is 46.
The spelling of 157088224801 in words is "one hundred fifty-seven billion, eighty-eight million, two hundred twenty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •