Base | Representation |
---|---|
bin | 10111010101110000101110… |
… | …10100100110111010101011 |
3 | 20201201122102221201021012010 |
4 | 23222320113110212322223 |
5 | 23211403103104343301 |
6 | 301054254454051003 |
7 | 13545061360465044 |
oct | 1352702724467253 |
9 | 221648387637163 |
10 | 51325250465451 |
11 | 15398a09928746 |
12 | 590b216649a63 |
13 | 2283c47bca121 |
14 | c962264d78cb |
15 | 5e014a72e5d6 |
hex | 2eae17526eab |
51325250465451 has 8 divisors (see below), whose sum is σ = 70641204941824. Its totient is φ = 33113064816360.
The previous prime is 51325250465441. The next prime is 51325250465477. The reversal of 51325250465451 is 15456405252315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51325250465451 - 215 = 51325250432683 is a prime.
It is a super-3 number, since 3×513252504654513 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51325250465451.
It is not an unprimeable number, because it can be changed into a prime (51325250465441) 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, 275942206711 + ... + 275942206896.
It is an arithmetic number, because the mean of its divisors is an integer number (8830150617728).
Almost surely, 251325250465451 is an apocalyptic number.
51325250465451 is a deficient number, since it is larger than the sum of its proper divisors (19315954476373).
51325250465451 is a wasteful number, since it uses less digits than its factorization.
51325250465451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 551884413641.
The product of its (nonzero) digits is 3600000, while the sum is 48.
The spelling of 51325250465451 in words is "fifty-one trillion, three hundred twenty-five billion, two hundred fifty million, four hundred sixty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •