Base | Representation |
---|---|
bin | 100100110110100110… |
… | …0111000100000010001 |
3 | 21120021111201000022101 |
4 | 1021231030320200101 |
5 | 2244040211130131 |
6 | 100205045040401 |
7 | 5501125456564 |
oct | 1115514704021 |
9 | 246244630271 |
10 | 79141505041 |
11 | 30622353115 |
12 | 134083b6101 |
13 | 7603311031 |
14 | 3b8ab444db |
15 | 20d2e3ec61 |
hex | 126d338811 |
79141505041 has 3 divisors (see below), whose sum is σ = 79141786363. Its totient is φ = 79141223720.
The previous prime is 79141505017. The next prime is 79141505063. The reversal of 79141505041 is 14050514197.
The square root of 79141505041 is 281321.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 28875865041 + 50265640000 = 169929^2 + 224200^2 .
It is not a de Polignac number, because 79141505041 - 27 = 79141504913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (79141505341) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 140661 + ... + 421981.
Almost surely, 279141505041 is an apocalyptic number.
79141505041 is the 281321-st square number.
79141505041 is the 140661-st centered octagonal number.
It is an amenable number.
79141505041 is a deficient number, since it is larger than the sum of its proper divisors (281322).
79141505041 is an frugal number, since it uses more digits than its factorization.
79141505041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562642 (or 281321 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 37.
The spelling of 79141505041 in words is "seventy-nine billion, one hundred forty-one million, five hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •