Base | Representation |
---|---|
bin | 101111101110011010… |
… | …000011001000110111 |
3 | 11220021022110120222012 |
4 | 233232122003020313 |
5 | 1314422034240023 |
6 | 35312534154435 |
7 | 3462612414653 |
oct | 575632031067 |
9 | 156238416865 |
10 | 51244446263 |
11 | 1a807176a3a |
12 | 9b217b2a1b |
13 | 4aa882676a |
14 | 26a1b0da63 |
15 | 14edc5e978 |
hex | bee683237 |
51244446263 has 4 divisors (see below), whose sum is σ = 52494310848. Its totient is φ = 49994581680.
The previous prime is 51244446257. The next prime is 51244446271. The reversal of 51244446263 is 36264444215.
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 51244446263 - 28 = 51244446007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41), and also a Moran number because the ratio is a prime number: 1249864543 = 51244446263 / (5 + 1 + 2 + 4 + 4 + 4 + 4 + 6 + 2 + 6 + 3).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51244446263.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51244446233) 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, 624932231 + ... + 624932312.
It is an arithmetic number, because the mean of its divisors is an integer number (13123577712).
Almost surely, 251244446263 is an apocalyptic number.
51244446263 is a deficient number, since it is larger than the sum of its proper divisors (1249864585).
51244446263 is a wasteful number, since it uses less digits than its factorization.
51244446263 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1249864584.
The product of its digits is 552960, while the sum is 41.
The spelling of 51244446263 in words is "fifty-one billion, two hundred forty-four million, four hundred forty-six thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •