Base | Representation |
---|---|
bin | 100101000111110111001… |
… | …110001010011011110001 |
3 | 100000212201222122112202001 |
4 | 211013313032022123301 |
5 | 313244034200313013 |
6 | 5231535311454001 |
7 | 352210504124653 |
oct | 45076716123361 |
9 | 10025658575661 |
10 | 2551063291633 |
11 | 8a39997a404a |
12 | 3524b5b27301 |
13 | 15674481c2bc |
14 | 8b6877086d3 |
15 | 4655b9d9ddd |
hex | 251f738a6f1 |
2551063291633 has 4 divisors (see below), whose sum is σ = 2551073174500. Its totient is φ = 2551053408768.
The previous prime is 2551063291631. The next prime is 2551063291661. The reversal of 2551063291633 is 3361923601552.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1512685987569 + 1038377304064 = 1229913^2 + 1019008^2 .
It is a cyclic number.
It is not a de Polignac number, because 2551063291633 - 21 = 2551063291631 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2551063291631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4543560 + ... + 5074057.
It is an arithmetic number, because the mean of its divisors is an integer number (637768293625).
Almost surely, 22551063291633 is an apocalyptic number.
It is an amenable number.
2551063291633 is a deficient number, since it is larger than the sum of its proper divisors (9882867).
2551063291633 is an equidigital number, since it uses as much as digits as its factorization.
2551063291633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9882866.
The product of its (nonzero) digits is 874800, while the sum is 46.
The spelling of 2551063291633 in words is "two trillion, five hundred fifty-one billion, sixty-three million, two hundred ninety-one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •