Base | Representation |
---|---|
bin | 1100001100001… |
… | …1110001011011 |
3 | 10120012212000111 |
4 | 3003003301123 |
5 | 101042233111 |
6 | 5023545151 |
7 | 1160425231 |
oct | 303036133 |
9 | 116185014 |
10 | 51133531 |
11 | 26955419 |
12 | 1515b1b7 |
13 | a794337 |
14 | 6b10951 |
15 | 4750a21 |
hex | 30c3c5b |
51133531 has 4 divisors (see below), whose sum is σ = 53356752. Its totient is φ = 48910312.
The previous prime is 51133483. The next prime is 51133547. The reversal of 51133531 is 13533115.
51133531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51133531 - 213 = 51125339 is a prime.
It is a super-2 number, since 2×511335312 = 5229275985055922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51133571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1111576 + ... + 1111621.
It is an arithmetic number, because the mean of its divisors is an integer number (13339188).
Almost surely, 251133531 is an apocalyptic number.
51133531 is a deficient number, since it is larger than the sum of its proper divisors (2223221).
51133531 is a wasteful number, since it uses less digits than its factorization.
51133531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2223220.
The product of its digits is 675, while the sum is 22.
The square root of 51133531 is about 7150.7713569936. The cubic root of 51133531 is about 371.1663486814.
Adding to 51133531 its reverse (13533115), we get a palindrome (64666646).
The spelling of 51133531 in words is "fifty-one million, one hundred thirty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •