Base | Representation |
---|---|
bin | 101111111110001111… |
… | …001010111110000101 |
3 | 11220221211012122122210 |
4 | 233332033022332011 |
5 | 1320443031431323 |
6 | 35355142414033 |
7 | 3502316014125 |
oct | 577617127605 |
9 | 156854178583 |
10 | 51510030213 |
11 | 1a933084104 |
12 | 9b96731319 |
13 | 4b1b864525 |
14 | 26c90c4c85 |
15 | 1517221293 |
hex | bfe3caf85 |
51510030213 has 16 divisors (see below), whose sum is σ = 71684006400. Its totient is φ = 32838782064.
The previous prime is 51510030211. The next prime is 51510030217. The reversal of 51510030213 is 31203001515.
It is not a de Polignac number, because 51510030213 - 21 = 51510030211 is a prime.
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 51510030213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51510030211) 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 15 ways as a sum of consecutive naturals, for example, 191770 + ... + 373892.
It is an arithmetic number, because the mean of its divisors is an integer number (4480250400).
Almost surely, 251510030213 is an apocalyptic number.
It is an amenable number.
51510030213 is a deficient number, since it is larger than the sum of its proper divisors (20173976187).
51510030213 is a wasteful number, since it uses less digits than its factorization.
51510030213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186248.
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 51510030213 its reverse (31203001515), we get a palindrome (82713031728).
The spelling of 51510030213 in words is "fifty-one billion, five hundred ten million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •