Base | Representation |
---|---|
bin | 101111100011010110… |
… | …111001100011101111 |
3 | 11212210101122120012200 |
4 | 233203112321203233 |
5 | 1314032110234330 |
6 | 35242313032543 |
7 | 3455201641635 |
oct | 574326714357 |
9 | 155711576180 |
10 | 51059071215 |
11 | 1a721572a19 |
12 | 9a8b6b5753 |
13 | 4a792c0199 |
14 | 2685257355 |
15 | 14dc843a60 |
hex | be35b98ef |
51059071215 has 12 divisors (see below), whose sum is σ = 88502390184. Its totient is φ = 27231504624.
The previous prime is 51059071213. The next prime is 51059071267. The reversal of 51059071215 is 51217095015.
51059071215 is a `hidden beast` number, since 51 + 0 + 590 + 7 + 1 + 2 + 15 = 666.
It is not a de Polignac number, because 51059071215 - 21 = 51059071213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51059071215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51059071211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 567322969 + ... + 567323058.
It is an arithmetic number, because the mean of its divisors is an integer number (7375199182).
Almost surely, 251059071215 is an apocalyptic number.
51059071215 is a deficient number, since it is larger than the sum of its proper divisors (37443318969).
51059071215 is a wasteful number, since it uses less digits than its factorization.
51059071215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134646038 (or 1134646035 counting only the distinct ones).
The product of its (nonzero) digits is 15750, while the sum is 36.
The spelling of 51059071215 in words is "fifty-one billion, fifty-nine million, seventy-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •