Base | Representation |
---|---|
bin | 101111100111110001… |
… | …101110100111001101 |
3 | 11212222120011100210122 |
4 | 233213301232213031 |
5 | 1314210100310013 |
6 | 35253522114325 |
7 | 3460062066062 |
oct | 574761564715 |
9 | 155876140718 |
10 | 51133213133 |
11 | 1a75a402932 |
12 | 9ab04ab9a5 |
13 | 4a8b77c042 |
14 | 2691036c69 |
15 | 14e40dba08 |
hex | be7c6e9cd |
51133213133 has 8 divisors (see below), whose sum is σ = 51488066880. Its totient is φ = 50779421280.
The previous prime is 51133213091. The next prime is 51133213151. The reversal of 51133213133 is 33131233115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51133213133 - 220 = 51132164557 is a prime.
It is a super-2 number, since 2×511332131332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51133213433) 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 7 ways as a sum of consecutive naturals, for example, 168713 + ... + 361566.
It is an arithmetic number, because the mean of its divisors is an integer number (6436008360).
Almost surely, 251133213133 is an apocalyptic number.
It is an amenable number.
51133213133 is a deficient number, since it is larger than the sum of its proper divisors (354853747).
51133213133 is a wasteful number, since it uses less digits than its factorization.
51133213133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530947.
The product of its digits is 2430, while the sum is 26.
Adding to 51133213133 its reverse (33131233115), we get a palindrome (84264446248).
The spelling of 51133213133 in words is "fifty-one billion, one hundred thirty-three million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •