Base | Representation |
---|---|
bin | 100110111011101001101… |
… | …1011010010000000110001 |
3 | 200221112022011020222011002 |
4 | 1031313103123102000301 |
5 | 1200131400021142021 |
6 | 15214040503531345 |
7 | 1061403231462350 |
oct | 115672333220061 |
9 | 20845264228132 |
10 | 5350781427761 |
11 | 1783287692080 |
12 | 725025a59b55 |
13 | 2ca765812183 |
14 | 146d9cd0b997 |
15 | 942bd17e50b |
hex | 4ddd36d2031 |
5350781427761 has 8 divisors (see below), whose sum is σ = 6671104117824. Its totient is φ = 4169440073520.
The previous prime is 5350781427757. The next prime is 5350781427799. The reversal of 5350781427761 is 1677241870535.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5350781427761 - 22 = 5350781427757 is a prime.
It is a super-2 number, since 2×53507814277612 (a number of 26 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 = 5350781427697 and 5350781427706.
It is not an unprimeable number, because it can be changed into a prime (5350781427461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34745333870 + ... + 34745334023.
It is an arithmetic number, because the mean of its divisors is an integer number (833888014728).
Almost surely, 25350781427761 is an apocalyptic number.
It is an amenable number.
5350781427761 is a deficient number, since it is larger than the sum of its proper divisors (1320322690063).
5350781427761 is a wasteful number, since it uses less digits than its factorization.
5350781427761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69490667911.
The product of its (nonzero) digits is 9878400, while the sum is 56.
The spelling of 5350781427761 in words is "five trillion, three hundred fifty billion, seven hundred eighty-one million, four hundred twenty-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •