Base | Representation |
---|---|
bin | 10110101110100101101110… |
… | …11000111010110010111101 |
3 | 20112221222100110222022210110 |
4 | 23113102313120322302331 |
5 | 23022330114423002234 |
6 | 254144103024100233 |
7 | 13345613022243606 |
oct | 1327226730726275 |
9 | 215858313868713 |
10 | 49979316219069 |
11 | 14a1a122058366 |
12 | 57323aba64679 |
13 | 21b704c497453 |
14 | c4b0245aadad |
15 | 5ba123d771e9 |
hex | 2d74b763acbd |
49979316219069 has 4 divisors (see below), whose sum is σ = 66639088292096. Its totient is φ = 33319544146044.
The previous prime is 49979316218987. The next prime is 49979316219089. The reversal of 49979316219069 is 96091261397994.
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 not a de Polignac number, because 49979316219069 - 232 = 49975021251773 is a prime.
It is a super-2 number, since 2×499793162190692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49979316219089) 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, 8329886036509 + ... + 8329886036514.
It is an arithmetic number, because the mean of its divisors is an integer number (16659772073024).
Almost surely, 249979316219069 is an apocalyptic number.
It is an amenable number.
49979316219069 is a deficient number, since it is larger than the sum of its proper divisors (16659772073027).
49979316219069 is a wasteful number, since it uses less digits than its factorization.
49979316219069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16659772073026.
The product of its (nonzero) digits is 357128352, while the sum is 75.
The spelling of 49979316219069 in words is "forty-nine trillion, nine hundred seventy-nine billion, three hundred sixteen million, two hundred nineteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •