Base | Representation |
---|---|
bin | 101111100001000110… |
… | …000110101111010101 |
3 | 11212200202020011010221 |
4 | 233201012012233111 |
5 | 1313442401124300 |
6 | 35234435314341 |
7 | 3454231213306 |
oct | 574106065725 |
9 | 155622204127 |
10 | 51021114325 |
11 | 1a7020a8395 |
12 | 9a7aa4b9b1 |
13 | 4a7149059c |
14 | 26801b67ad |
15 | 14d934731a |
hex | be1186bd5 |
51021114325 has 12 divisors (see below), whose sum is σ = 63301365988. Its totient is φ = 40794192000.
The previous prime is 51021114317. The next prime is 51021114329. The reversal of 51021114325 is 52341112015.
It can be written as a sum of positive squares in 6 ways, for example, as 35022724 + 50986091601 = 5918^2 + 225801^2 .
It is not a de Polignac number, because 51021114325 - 23 = 51021114317 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 51021114325.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51021114329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 521562 + ... + 611611.
Almost surely, 251021114325 is an apocalyptic number.
It is an amenable number.
51021114325 is a deficient number, since it is larger than the sum of its proper divisors (12280251663).
51021114325 is a wasteful number, since it uses less digits than its factorization.
51021114325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134984 (or 1134979 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
The spelling of 51021114325 in words is "fifty-one billion, twenty-one million, one hundred fourteen thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •