Base | Representation |
---|---|
bin | 10111011000001111… |
… | …10101101000011011 |
3 | 1012101201200210202102 |
4 | 23230013311220123 |
5 | 201201130143001 |
6 | 5433244154015 |
7 | 623015146430 |
oct | 135407655033 |
9 | 35351623672 |
10 | 12551412251 |
11 | 5360a43884 |
12 | 252353890b |
13 | 125047aa71 |
14 | 870d57b87 |
15 | 4d6d91e6b |
hex | 2ec1f5a1b |
12551412251 has 8 divisors (see below), whose sum is σ = 14839108320. Its totient is φ = 10387375488.
The previous prime is 12551412221. The next prime is 12551412281. The reversal of 12551412251 is 15221415521.
It is an interprime number because it is at equal distance from previous prime (12551412221) and next prime (12551412281).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12551412251 - 26 = 12551412187 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12551412221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30914606 + ... + 30915011.
It is an arithmetic number, because the mean of its divisors is an integer number (1854888540).
Almost surely, 212551412251 is an apocalyptic number.
12551412251 is a deficient number, since it is larger than the sum of its proper divisors (2287696069).
12551412251 is an equidigital number, since it uses as much as digits as its factorization.
12551412251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61829653.
The product of its digits is 4000, while the sum is 29.
Adding to 12551412251 its reverse (15221415521), we get a palindrome (27772827772).
The spelling of 12551412251 in words is "twelve billion, five hundred fifty-one million, four hundred twelve thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •