Base | Representation |
---|---|
bin | 100100110000001100110… |
… | …0110100000100101011001 |
3 | 122212220022112221022201001 |
4 | 1021200121212200211121 |
5 | 1130230041113043213 |
6 | 14424312410425001 |
7 | 1030642124423113 |
oct | 111403146404531 |
9 | 18786275838631 |
10 | 5051311065433 |
11 | 1678281455466 |
12 | 696b89a32161 |
13 | 2a844b644749 |
14 | 1366b02783b3 |
15 | 8b5e22401dd |
hex | 498199a0959 |
5051311065433 has 16 divisors (see below), whose sum is σ = 5262563214720. Its totient is φ = 4844262729600.
The previous prime is 5051311065431. The next prime is 5051311065457. The reversal of 5051311065433 is 3345601131505.
It is a cyclic number.
It is not a de Polignac number, because 5051311065433 - 21 = 5051311065431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5051311065392 and 5051311065401.
It is not an unprimeable number, because it can be changed into a prime (5051311065431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42105691 + ... + 42225487.
It is an arithmetic number, because the mean of its divisors is an integer number (328910200920).
Almost surely, 25051311065433 is an apocalyptic number.
It is an amenable number.
5051311065433 is a deficient number, since it is larger than the sum of its proper divisors (211252149287).
5051311065433 is a wasteful number, since it uses less digits than its factorization.
5051311065433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137328.
The product of its (nonzero) digits is 81000, while the sum is 37.
Adding to 5051311065433 its reverse (3345601131505), we get a palindrome (8396912196938).
The spelling of 5051311065433 in words is "five trillion, fifty-one billion, three hundred eleven million, sixty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •