Base | Representation |
---|---|
bin | 1000011000110010… |
… | …0000000100110011 |
3 | 12210220110012011222 |
4 | 2012030200010303 |
5 | 14102331032201 |
6 | 1011223455255 |
7 | 106535534342 |
oct | 20614400463 |
9 | 5726405158 |
10 | 2251424051 |
11 | a55963238 |
12 | 529bb752b |
13 | 29b597ca6 |
14 | 175025b59 |
15 | d29c891b |
hex | 86320133 |
2251424051 has 8 divisors (see below), whose sum is σ = 2292432144. Its totient is φ = 2210548320.
The previous prime is 2251424041. The next prime is 2251424059. The reversal of 2251424051 is 1504241522.
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 2251424051 - 226 = 2184315187 is a prime.
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 2251424051.
It is not an unprimeable number, because it can be changed into a prime (2251424059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1565 + ... + 67121.
It is an arithmetic number, because the mean of its divisors is an integer number (286554018).
Almost surely, 22251424051 is an apocalyptic number.
2251424051 is a deficient number, since it is larger than the sum of its proper divisors (41008093).
2251424051 is an equidigital number, since it uses as much as digits as its factorization.
2251424051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66181.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 2251424051 is about 47449.1733436948. The cubic root of 2251424051 is about 1310.6470883877.
Adding to 2251424051 its reverse (1504241522), we get a palindrome (3755665573).
The spelling of 2251424051 in words is "two billion, two hundred fifty-one million, four hundred twenty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •