Base | Representation |
---|---|
bin | 10111010110001100101010… |
… | …00100011001000011001111 |
3 | 20201210002010221122212001002 |
4 | 23223012111010121003033 |
5 | 23212124310212423310 |
6 | 301105214420010515 |
7 | 13546132063351532 |
oct | 1353062504310317 |
9 | 221702127585032 |
10 | 51340245045455 |
11 | 153a4303988623 |
12 | 5912100230a3b |
13 | 2285497599182 |
14 | c96c49b0aa19 |
15 | 5e0726d22da5 |
hex | 2eb1951190cf |
51340245045455 has 8 divisors (see below), whose sum is σ = 62919108821952. Its totient is φ = 40198319524768.
The previous prime is 51340245045449. The next prime is 51340245045457. The reversal of 51340245045455 is 55454054204315.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51340245045455 - 236 = 51271525568719 is a prime.
It is a super-2 number, since 2×513402450454552 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51340245045457) 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, 109234563692 + ... + 109234564161.
It is an arithmetic number, because the mean of its divisors is an integer number (7864888602744).
Almost surely, 251340245045455 is an apocalyptic number.
51340245045455 is a deficient number, since it is larger than the sum of its proper divisors (11578863776497).
51340245045455 is a wasteful number, since it uses less digits than its factorization.
51340245045455 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218469127905.
The product of its (nonzero) digits is 4800000, while the sum is 47.
The spelling of 51340245045455 in words is "fifty-one trillion, three hundred forty billion, two hundred forty-five million, forty-five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •