Base | Representation |
---|---|
bin | 101111101100100010… |
… | …001010111110000101 |
3 | 11220012010100000200211 |
4 | 233230202022332011 |
5 | 1314341013133221 |
6 | 35305452435421 |
7 | 3462051332206 |
oct | 575442127605 |
9 | 156163300624 |
10 | 51213021061 |
11 | 1a7a04627a4 |
12 | 9b13178b71 |
13 | 4aa2172b77 |
14 | 269b88d5ad |
15 | 14eb1036e1 |
hex | bec88af85 |
51213021061 has 4 divisors (see below), whose sum is σ = 51213484000. Its totient is φ = 51212558124.
The previous prime is 51213021029. The next prime is 51213021071. The reversal of 51213021061 is 16012031215.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 51213021061 - 25 = 51213021029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51213021071) 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 3 ways as a sum of consecutive naturals, for example, 42790 + ... + 322888.
It is an arithmetic number, because the mean of its divisors is an integer number (12803371000).
Almost surely, 251213021061 is an apocalyptic number.
It is an amenable number.
51213021061 is a deficient number, since it is larger than the sum of its proper divisors (462939).
51213021061 is a wasteful number, since it uses less digits than its factorization.
51213021061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462938.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 51213021061 its reverse (16012031215), we get a palindrome (67225052276).
The spelling of 51213021061 in words is "fifty-one billion, two hundred thirteen million, twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •