Base | Representation |
---|---|
bin | 1000000001001110… |
… | …0100010100011111 |
3 | 12120000112002010000 |
4 | 2000103210110133 |
5 | 13402032110101 |
6 | 553333545343 |
7 | 104225624043 |
oct | 20023442437 |
9 | 5500462100 |
10 | 2152613151 |
11 | a05104137 |
12 | 500aa5253 |
13 | 283c7c7c0 |
14 | 165c64023 |
15 | c8eab486 |
hex | 804e451f |
2152613151 has 80 divisors (see below), whose sum is σ = 3860287200. Its totient is φ = 1180956672.
The previous prime is 2152613143. The next prime is 2152613161. The reversal of 2152613151 is 1513162512.
2152613151 is a `hidden beast` number, since 2 + 1 + 526 + 131 + 5 + 1 = 666.
It is not a de Polignac number, because 2152613151 - 23 = 2152613143 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2152613161) 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 79 ways as a sum of consecutive naturals, for example, 336955 + ... + 343283.
It is an arithmetic number, because the mean of its divisors is an integer number (48253590).
Almost surely, 22152613151 is an apocalyptic number.
2152613151 is a deficient number, since it is larger than the sum of its proper divisors (1707674049).
2152613151 is a wasteful number, since it uses less digits than its factorization.
2152613151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6390 (or 6381 counting only the distinct ones).
The product of its digits is 1800, while the sum is 27.
The square root of 2152613151 is about 46396.2622524703. The cubic root of 2152613151 is about 1291.1855677292.
Adding to 2152613151 its reverse (1513162512), we get a palindrome (3665775663).
The spelling of 2152613151 in words is "two billion, one hundred fifty-two million, six hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •