Base | Representation |
---|---|
bin | 1001100000001101… |
… | …1000110111110111 |
3 | 20120210012111121201 |
4 | 2120003120313313 |
5 | 20211030301033 |
6 | 1101045153331 |
7 | 120134233042 |
oct | 23003306767 |
9 | 6523174551 |
10 | 2551025143 |
11 | 1099a94a47 |
12 | 5b23bb847 |
13 | 318686344 |
14 | 1a2b33c59 |
15 | ede5947d |
hex | 980d8df7 |
2551025143 has 4 divisors (see below), whose sum is σ = 2566675768. Its totient is φ = 2535374520.
The previous prime is 2551025119. The next prime is 2551025153. The reversal of 2551025143 is 3415201552.
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 2551025143 - 25 = 2551025111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2551025153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7825068 + ... + 7825393.
It is an arithmetic number, because the mean of its divisors is an integer number (641668942).
Almost surely, 22551025143 is an apocalyptic number.
2551025143 is a deficient number, since it is larger than the sum of its proper divisors (15650625).
2551025143 is a wasteful number, since it uses less digits than its factorization.
2551025143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15650624.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 2551025143 is about 50507.6741000811. The cubic root of 2551025143 is about 1366.3802616244.
Adding to 2551025143 its reverse (3415201552), we get a palindrome (5966226695).
It can be divided in two parts, 25510 and 25143, that added together give a cube (50653 = 373).
The spelling of 2551025143 in words is "two billion, five hundred fifty-one million, twenty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •