Base | Representation |
---|---|
bin | 100110111011100111101… |
… | …0000001001101001001101 |
3 | 200221112010021111020112201 |
4 | 1031313033100021221031 |
5 | 1200131224104313122 |
6 | 15214025523001501 |
7 | 1061401421324662 |
oct | 115671720115115 |
9 | 20845107436481 |
10 | 5350711401037 |
11 | 1783251102a52 |
12 | 725006509291 |
13 | 2ca754164442 |
14 | 146d938bda69 |
15 | 942b6e4aa27 |
hex | 4ddcf409a4d |
5350711401037 has 8 divisors (see below), whose sum is σ = 5402768299136. Its totient is φ = 5298656584752.
The previous prime is 5350711401031. The next prime is 5350711401071. The reversal of 5350711401037 is 7301041170535.
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 5350711401037 - 235 = 5316351662669 is a prime.
It is a super-2 number, since 2×53507114010372 (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 = 5350711400987 and 5350711401005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5350711401031) 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, 4920283 + ... + 5908519.
It is an arithmetic number, because the mean of its divisors is an integer number (675346037392).
Almost surely, 25350711401037 is an apocalyptic number.
It is an amenable number.
5350711401037 is a deficient number, since it is larger than the sum of its proper divisors (52056898099).
5350711401037 is a wasteful number, since it uses less digits than its factorization.
5350711401037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1040907.
The product of its (nonzero) digits is 44100, while the sum is 37.
The spelling of 5350711401037 in words is "five trillion, three hundred fifty billion, seven hundred eleven million, four hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •