Base | Representation |
---|---|
bin | 10111001101100101011010… |
… | …11001010101010111001101 |
3 | 20200201210021001200110211001 |
4 | 23212302231121111113031 |
5 | 23142302211403221013 |
6 | 300321232232100301 |
7 | 13515554230636642 |
oct | 1346625531252715 |
9 | 220653231613731 |
10 | 51044300445133 |
11 | 1529a847974106 |
12 | 5884888b34691 |
13 | 22635c29b8058 |
14 | c867b341ddc9 |
15 | 5d7ba56cdddd |
hex | 2e6cad6555cd |
51044300445133 has 2 divisors, whose sum is σ = 51044300445134. Its totient is φ = 51044300445132.
The previous prime is 51044300445101. The next prime is 51044300445211. The reversal of 51044300445133 is 33154400344015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27841948243209 + 23202352201924 = 5276547^2 + 4816882^2 .
It is a cyclic number.
It is not a de Polignac number, because 51044300445133 - 25 = 51044300445101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51044300445092 and 51044300445101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51044300445833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25522150222566 + 25522150222567.
It is an arithmetic number, because the mean of its divisors is an integer number (25522150222567).
Almost surely, 251044300445133 is an apocalyptic number.
It is an amenable number.
51044300445133 is a deficient number, since it is larger than the sum of its proper divisors (1).
51044300445133 is an equidigital number, since it uses as much as digits as its factorization.
51044300445133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 51044300445133 its reverse (33154400344015), we get a palindrome (84198700789148).
The spelling of 51044300445133 in words is "fifty-one trillion, forty-four billion, three hundred million, four hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •