Base | Representation |
---|---|
bin | 10111010101101100100101… |
… | …00101100111011111100011 |
3 | 20201201102200202101110200220 |
4 | 23222312102211213133203 |
5 | 23211334023012221111 |
6 | 301053245503414123 |
7 | 13544652240164301 |
oct | 1352662245473743 |
9 | 221642622343626 |
10 | 51323023554531 |
11 | 15397a768985a3 |
12 | 590a8b48b4343 |
13 | 2283981735861 |
14 | c96094853271 |
15 | 5e0069e98e06 |
hex | 2ead929677e3 |
51323023554531 has 4 divisors (see below), whose sum is σ = 68430698072712. Its totient is φ = 34215349036352.
The previous prime is 51323023554521. The next prime is 51323023554581. The reversal of 51323023554531 is 13545532032315.
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 51323023554531 - 223 = 51323015165923 is a prime.
It is a super-2 number, since 2×513230235545312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51323023554521) 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, 8553837259086 + ... + 8553837259091.
It is an arithmetic number, because the mean of its divisors is an integer number (17107674518178).
Almost surely, 251323023554531 is an apocalyptic number.
51323023554531 is a deficient number, since it is larger than the sum of its proper divisors (17107674518181).
51323023554531 is a wasteful number, since it uses less digits than its factorization.
51323023554531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17107674518180.
The product of its (nonzero) digits is 810000, while the sum is 42.
Adding to 51323023554531 its reverse (13545532032315), we get a palindrome (64868555586846).
The spelling of 51323023554531 in words is "fifty-one trillion, three hundred twenty-three billion, twenty-three million, five hundred fifty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •