Base | Representation |
---|---|
bin | 1001001000111110110… |
… | …0101011010101111001 |
3 | 120000022200001002001002 |
4 | 2102033230223111321 |
5 | 10033044044121114 |
6 | 200045522534345 |
7 | 14226225140444 |
oct | 2221754532571 |
9 | 500280032032 |
10 | 157029676409 |
11 | 60661182081 |
12 | 26524b073b5 |
13 | 11a66a75cb8 |
14 | 785923465b |
15 | 4140d0b7de |
hex | 248fb2b579 |
157029676409 has 4 divisors (see below), whose sum is σ = 165294396240. Its totient is φ = 148764956580.
The previous prime is 157029676369. The next prime is 157029676411. The reversal of 157029676409 is 904676920751.
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 157029676409 - 228 = 156761240953 is a prime.
It is a super-2 number, since 2×1570296764092 (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 (157029679409) 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, 4132359887 + ... + 4132359924.
It is an arithmetic number, because the mean of its divisors is an integer number (41323599060).
Almost surely, 2157029676409 is an apocalyptic number.
157029676409 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
157029676409 is a deficient number, since it is larger than the sum of its proper divisors (8264719831).
157029676409 is an equidigital number, since it uses as much as digits as its factorization.
157029676409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8264719830.
The product of its (nonzero) digits is 5715360, while the sum is 56.
The spelling of 157029676409 in words is "one hundred fifty-seven billion, twenty-nine million, six hundred seventy-six thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •