Base | Representation |
---|---|
bin | 1001001000111001111… |
… | …1010010101010111101 |
3 | 120000021020212102200120 |
4 | 2102032133102222331 |
5 | 10033023400442034 |
6 | 200043520045153 |
7 | 14225560540254 |
oct | 2221637225275 |
9 | 500236772616 |
10 | 157009390269 |
11 | 60650786876 |
12 | 2651a1637b9 |
13 | 11a627c2574 |
14 | 785667379b |
15 | 413e150c49 |
hex | 248e7d2abd |
157009390269 has 4 divisors (see below), whose sum is σ = 209345853696. Its totient is φ = 104672926844.
The previous prime is 157009390249. The next prime is 157009390277. The reversal of 157009390269 is 962093900751.
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 157009390269 - 224 = 156992613053 is a prime.
It is a super-2 number, since 2×1570093902692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157009390229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26168231709 + ... + 26168231714.
It is an arithmetic number, because the mean of its divisors is an integer number (52336463424).
Almost surely, 2157009390269 is an apocalyptic number.
It is an amenable number.
157009390269 is a deficient number, since it is larger than the sum of its proper divisors (52336463427).
157009390269 is an equidigital number, since it uses as much as digits as its factorization.
157009390269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52336463426.
The product of its (nonzero) digits is 918540, while the sum is 51.
The spelling of 157009390269 in words is "one hundred fifty-seven billion, nine million, three hundred ninety thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •