Base | Representation |
---|---|
bin | 101111101110100000… |
… | …001110001001010111 |
3 | 11220021102111210101100 |
4 | 233232200032021113 |
5 | 1314422443023330 |
6 | 35313033001143 |
7 | 3462632234013 |
oct | 575640161127 |
9 | 156242453340 |
10 | 51246064215 |
11 | 1a808081595 |
12 | 9b222531b3 |
13 | 4aa8c72028 |
14 | 26a2011543 |
15 | 14ede7e060 |
hex | bee80e257 |
51246064215 has 12 divisors (see below), whose sum is σ = 88826511384. Its totient is φ = 27331234224.
The previous prime is 51246064213. The next prime is 51246064267.
51246064215 is a `hidden beast` number, since 5 + 1 + 2 + 4 + 6 + 0 + 642 + 1 + 5 = 666.
51246064215 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51246064215 - 21 = 51246064213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51246064215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51246064213) 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, 569400669 + ... + 569400758.
It is an arithmetic number, because the mean of its divisors is an integer number (7402209282).
Almost surely, 251246064215 is an apocalyptic number.
51246064215 is a deficient number, since it is larger than the sum of its proper divisors (37580447169).
51246064215 is a wasteful number, since it uses less digits than its factorization.
51246064215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138801438 (or 1138801435 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
It can be divided in two parts, 512460 and 64215, that added together give a palindrome (576675).
The spelling of 51246064215 in words is "fifty-one billion, two hundred forty-six million, sixty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •