Base | Representation |
---|---|
bin | 101111101000110100… |
… | …100001001111110001 |
3 | 11220000210002220111102 |
4 | 233220310201033301 |
5 | 1314224041101113 |
6 | 35255345254145 |
7 | 3460363651325 |
oct | 575064411761 |
9 | 156023086442 |
10 | 51150722033 |
11 | 1a7692815a4 |
12 | 9ab6334355 |
13 | 4a9229c638 |
14 | 26934b3985 |
15 | 14e58e9758 |
hex | be8d213f1 |
51150722033 has 4 divisors (see below), whose sum is σ = 51182672868. Its totient is φ = 51118771200.
The previous prime is 51150722003. The next prime is 51150722053. The reversal of 51150722033 is 33022705115.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35459902864 + 15690819169 = 188308^2 + 125263^2 .
It is a cyclic number.
It is not a de Polignac number, because 51150722033 - 214 = 51150705649 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51150721987 and 51150722005.
It is not an unprimeable number, because it can be changed into a prime (51150722003) 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, 15973016 + ... + 15976217.
It is an arithmetic number, because the mean of its divisors is an integer number (12795668217).
Almost surely, 251150722033 is an apocalyptic number.
It is an amenable number.
51150722033 is a deficient number, since it is larger than the sum of its proper divisors (31950835).
51150722033 is a wasteful number, since it uses less digits than its factorization.
51150722033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31950834.
The product of its (nonzero) digits is 6300, while the sum is 29.
The spelling of 51150722033 in words is "fifty-one billion, one hundred fifty million, seven hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •