Base | Representation |
---|---|
bin | 101111100001110101… |
… | …000110001110110101 |
3 | 11212201121102000012122 |
4 | 233201311012032311 |
5 | 1314004024324023 |
6 | 35235555325325 |
7 | 3454441010663 |
oct | 574165061665 |
9 | 155647360178 |
10 | 51033433013 |
11 | 1a709051622 |
12 | 9a82bb0845 |
13 | 4a73bb4654 |
14 | 2681aa1c33 |
15 | 14da47c2c8 |
hex | be1d463b5 |
51033433013 has 4 divisors (see below), whose sum is σ = 51485056428. Its totient is φ = 50581809600.
The previous prime is 51033432991. The next prime is 51033433027. The reversal of 51033433013 is 31033433015.
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 1430125489 + 49603307524 = 37817^2 + 222718^2 .
It is a cyclic number.
It is not a de Polignac number, because 51033433013 - 26 = 51033432949 is a prime.
It is a super-2 number, since 2×510334330132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51033433043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 225811538 + ... + 225811763.
It is an arithmetic number, because the mean of its divisors is an integer number (12871264107).
Almost surely, 251033433013 is an apocalyptic number.
It is an amenable number.
51033433013 is a deficient number, since it is larger than the sum of its proper divisors (451623415).
51033433013 is a wasteful number, since it uses less digits than its factorization.
51033433013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451623414.
The product of its (nonzero) digits is 4860, while the sum is 26.
Adding to 51033433013 its reverse (31033433015), we get a palindrome (82066866028).
The spelling of 51033433013 in words is "fifty-one billion, thirty-three million, four hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •