Base | Representation |
---|---|
bin | 10111010000010111111101… |
… | …00000110111000110111101 |
3 | 20201001221200000202112221122 |
4 | 23220023332200313012331 |
5 | 23200340012031401443 |
6 | 300433243314440325 |
7 | 13525516415160125 |
oct | 1350137640670675 |
9 | 221057600675848 |
10 | 51140150653373 |
11 | 15327463906241 |
12 | 589b378b930a5 |
13 | 226c65984abc2 |
14 | c8b2a7297c85 |
15 | 5da415455968 |
hex | 2e82fe8371bd |
51140150653373 has 2 divisors, whose sum is σ = 51140150653374. Its totient is φ = 51140150653372.
The previous prime is 51140150653283. The next prime is 51140150653469. The reversal of 51140150653373 is 37335605104115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49801841789764 + 1338308863609 = 7057042^2 + 1156853^2 .
It is a cyclic number.
It is not a de Polignac number, because 51140150653373 - 212 = 51140150649277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51140150653873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25570075326686 + 25570075326687.
It is an arithmetic number, because the mean of its divisors is an integer number (25570075326687).
Almost surely, 251140150653373 is an apocalyptic number.
It is an amenable number.
51140150653373 is a deficient number, since it is larger than the sum of its proper divisors (1).
51140150653373 is an equidigital number, since it uses as much as digits as its factorization.
51140150653373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567000, while the sum is 44.
Adding to 51140150653373 its reverse (37335605104115), we get a palindrome (88475755757488).
The spelling of 51140150653373 in words is "fifty-one trillion, one hundred forty billion, one hundred fifty million, six hundred fifty-three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •