Base | Representation |
---|---|
bin | 10111001101100000100000… |
… | …00110101110011100110011 |
3 | 20200201112110011010102100001 |
4 | 23212300100012232130303 |
5 | 23142231310323403433 |
6 | 300320114323210431 |
7 | 13515431645436226 |
oct | 1346602006563463 |
9 | 220645404112301 |
10 | 51041661544243 |
11 | 15299713319887 |
12 | 5884271216a17 |
13 | 2263292074936 |
14 | c86602b735bd |
15 | 5d7a9dbb757d |
hex | 2e6c101ae733 |
51041661544243 has 4 divisors (see below), whose sum is σ = 51205782642768. Its totient is φ = 50877540445720.
The previous prime is 51041661544219. The next prime is 51041661544283. The reversal of 51041661544243 is 34244516614015.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51041661544243 is a prime.
It is a super-2 number, since 2×510416615442432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51041661544193 and 51041661544202.
It is not an unprimeable number, because it can be changed into a prime (51041661544283) 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, 82060548796 + ... + 82060549417.
It is an arithmetic number, because the mean of its divisors is an integer number (12801445660692).
Almost surely, 251041661544243 is an apocalyptic number.
51041661544243 is a deficient number, since it is larger than the sum of its proper divisors (164121098525).
51041661544243 is a wasteful number, since it uses less digits than its factorization.
51041661544243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164121098524.
The product of its (nonzero) digits is 1382400, while the sum is 46.
The spelling of 51041661544243 in words is "fifty-one trillion, forty-one billion, six hundred sixty-one million, five hundred forty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •