Base | Representation |
---|---|
bin | 10111010011011001011101… |
… | …11100011110011000100101 |
3 | 20201102212211102102210121012 |
4 | 23221230232330132120211 |
5 | 23204040244324213410 |
6 | 300553104343432005 |
7 | 13536155066441306 |
oct | 1351545674363045 |
9 | 221385742383535 |
10 | 51244042413605 |
11 | 15367527016408 |
12 | 58b7532155605 |
13 | 22793a5711c42 |
14 | c923211347ad |
15 | 5dce96184605 |
hex | 2e9b2ef1e625 |
51244042413605 has 8 divisors (see below), whose sum is σ = 62653093366392. Its totient is φ = 40221738950848.
The previous prime is 51244042413569. The next prime is 51244042413607. The reversal of 51244042413605 is 50631424044215.
It can be written as a sum of positive squares in 4 ways, for example, as 19534552483681 + 31709489929924 = 4419791^2 + 5631118^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 51244042413605 - 28 = 51244042413349 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 (51244042413607) 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, 96686872214 + ... + 96686872743.
It is an arithmetic number, because the mean of its divisors is an integer number (7831636670799).
Almost surely, 251244042413605 is an apocalyptic number.
It is an amenable number.
51244042413605 is a deficient number, since it is larger than the sum of its proper divisors (11409050952787).
51244042413605 is a wasteful number, since it uses less digits than its factorization.
51244042413605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193373745015.
The product of its (nonzero) digits is 460800, while the sum is 41.
The spelling of 51244042413605 in words is "fifty-one trillion, two hundred forty-four billion, forty-two million, four hundred thirteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •