Base | Representation |
---|---|
bin | 111101001110101… |
… | …0011001100011111 |
3 | 12022011220110202020 |
4 | 1322131103030133 |
5 | 13201423014101 |
6 | 535511031223 |
7 | 101624654163 |
oct | 17235231437 |
9 | 5264813666 |
10 | 2054501151 |
11 | 96479213a |
12 | 49406b513 |
13 | 26984a471 |
14 | 156c04ca3 |
15 | c057b136 |
hex | 7a75331f |
2054501151 has 16 divisors (see below), whose sum is σ = 2861602560. Its totient is φ = 1308665600.
The previous prime is 2054501131. The next prime is 2054501173. The reversal of 2054501151 is 1511054502.
2054501151 is a nontrivial binomial coefficient, being equal to C(64102, 2).
It is a cyclic number.
It is not a de Polignac number, because 2054501151 - 26 = 2054501087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2054501131) 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 15 ways as a sum of consecutive naturals, for example, 48076 + ... + 80126.
It is an arithmetic number, because the mean of its divisors is an integer number (178850160).
Almost surely, 22054501151 is an apocalyptic number.
2054501151 is the 64101-st triangular number and also the 32051-st hexagonal number.
2054501151 is a deficient number, since it is larger than the sum of its proper divisors (807101409).
2054501151 is a wasteful number, since it uses less digits than its factorization.
2054501151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33006.
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 2054501151 is about 45326.6053328506. The cubic root of 2054501151 is about 1271.2631636216.
Adding to 2054501151 its reverse (1511054502), we get a palindrome (3565555653).
The spelling of 2054501151 in words is "two billion, fifty-four million, five hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •