Base | Representation |
---|---|
bin | 1001100000010001… |
… | …1101010000011011 |
3 | 20120210201201211210 |
4 | 2120010131100123 |
5 | 20211113231433 |
6 | 1101055154203 |
7 | 120136510464 |
oct | 23004352033 |
9 | 6523651753 |
10 | 2551305243 |
11 | 109a166433 |
12 | 5b2515963 |
13 | 318753996 |
14 | 1a2ba7d6b |
15 | edeb2463 |
hex | 9811d41b |
2551305243 has 8 divisors (see below), whose sum is σ = 3601842768. Its totient is φ = 1600818944.
The previous prime is 2551305241. The next prime is 2551305271. The reversal of 2551305243 is 3425031552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2551305243 - 21 = 2551305241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2551305243.
It is not an unprimeable number, because it can be changed into a prime (2551305241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25012746 + ... + 25012847.
It is an arithmetic number, because the mean of its divisors is an integer number (450230346).
Almost surely, 22551305243 is an apocalyptic number.
2551305243 is a deficient number, since it is larger than the sum of its proper divisors (1050537525).
2551305243 is a wasteful number, since it uses less digits than its factorization.
2551305243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50025613.
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 2551305243 is about 50510.4468699298. The cubic root of 2551305243 is about 1366.4302688546.
Adding to 2551305243 its reverse (3425031552), we get a palindrome (5976336795).
The spelling of 2551305243 in words is "two billion, five hundred fifty-one million, three hundred five thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •