Base | Representation |
---|---|
bin | 101111101011110100… |
… | …100000101001001101 |
3 | 11220011021210220011010 |
4 | 233223310200221031 |
5 | 1314324432114323 |
6 | 35304344115433 |
7 | 3461544516534 |
oct | 575364405115 |
9 | 156137726133 |
10 | 51201051213 |
11 | 1a794727664 |
12 | 9b0b165b79 |
13 | 4a9c841810 |
14 | 269a05531b |
15 | 14ea03bc93 |
hex | bebd20a4d |
51201051213 has 8 divisors (see below), whose sum is σ = 73519458208. Its totient is φ = 31508339184.
The previous prime is 51201051151. The next prime is 51201051227. The reversal of 51201051213 is 31215010215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51201051213 - 210 = 51201050189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 51201051213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51201001213) 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 7 ways as a sum of consecutive naturals, for example, 656423695 + ... + 656423772.
It is an arithmetic number, because the mean of its divisors is an integer number (9189932276).
Almost surely, 251201051213 is an apocalyptic number.
It is an amenable number.
51201051213 is a deficient number, since it is larger than the sum of its proper divisors (22318406995).
51201051213 is a wasteful number, since it uses less digits than its factorization.
51201051213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312847483.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 51201051213 its reverse (31215010215), we get a palindrome (82416061428).
The spelling of 51201051213 in words is "fifty-one billion, two hundred one million, fifty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •