Base | Representation |
---|---|
bin | 10111001111111100010101… |
… | …00010110110000010101001 |
3 | 20201000112101110111010000101 |
4 | 23213332022202312002221 |
5 | 23200114123422124340 |
6 | 300422351532505401 |
7 | 13524453043523041 |
oct | 1347761242660251 |
9 | 221015343433011 |
10 | 51125320114345 |
11 | 15321143408814 |
12 | 589851a31b261 |
13 | 226b135155a19 |
14 | c8a69b786721 |
15 | 5d9d48466c9a |
hex | 2e7f8a8b60a9 |
51125320114345 has 8 divisors (see below), whose sum is σ = 61364529974664. Its totient is φ = 40890825533184.
The previous prime is 51125320114307. The next prime is 51125320114381. The reversal of 51125320114345 is 54341102352115.
It can be written as a sum of positive squares in 4 ways, for example, as 6709866496281 + 44415453618064 = 2590341^2 + 6664492^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 51125320114345 - 27 = 51125320114217 is a prime.
It is a super-2 number, since 2×511253201143452 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1178795934 + ... + 1178839303.
It is an arithmetic number, because the mean of its divisors is an integer number (7670566246833).
Almost surely, 251125320114345 is an apocalyptic number.
It is an amenable number.
51125320114345 is a deficient number, since it is larger than the sum of its proper divisors (10239209860319).
51125320114345 is a wasteful number, since it uses less digits than its factorization.
51125320114345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2357639579.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 51125320114345 in words is "fifty-one trillion, one hundred twenty-five billion, three hundred twenty million, one hundred fourteen thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •