Base | Representation |
---|---|
bin | 101011010010110011010… |
… | …1101000011001101000101 |
3 | 210001211122100101110210002 |
4 | 1112211212231003031011 |
5 | 1234442104203244342 |
6 | 20353301451411045 |
7 | 1152614545132223 |
oct | 126454655031505 |
9 | 23054570343702 |
10 | 5950252790597 |
11 | 1994540639755 |
12 | 801247753a85 |
13 | 34214ca9ba0b |
14 | 167dcaca3b13 |
15 | a4ba68c8d32 |
hex | 56966b43345 |
5950252790597 has 8 divisors (see below), whose sum is σ = 5955776565336. Its totient is φ = 5944729370112.
The previous prime is 5950252790591. The next prime is 5950252790609. The reversal of 5950252790597 is 7950972520595.
It is a Cunningham number, because it is equal to 24393142+1.
It can be written as a sum of positive squares in 4 ways, for example, as 1 + 5950252790596 = 1^2 + 2439314^2 .
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 5950252790597 - 210 = 5950252789573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5950252790591) 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, 43307873 + ... + 43445049.
It is an arithmetic number, because the mean of its divisors is an integer number (744472070667).
Almost surely, 25950252790597 is an apocalyptic number.
It is an amenable number.
5950252790597 is a deficient number, since it is larger than the sum of its proper divisors (5523774739).
5950252790597 is a wasteful number, since it uses less digits than its factorization.
5950252790597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177127.
The product of its (nonzero) digits is 89302500, while the sum is 65.
The spelling of 5950252790597 in words is "five trillion, nine hundred fifty billion, two hundred fifty-two million, seven hundred ninety thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •