Base | Representation |
---|---|
bin | 1000000001001000… |
… | …1001100001010101 |
3 | 12112222211011221102 |
4 | 2000102021201111 |
5 | 13401433204422 |
6 | 553321555445 |
7 | 104222514536 |
oct | 20022114125 |
9 | 5488734842 |
10 | 2152241237 |
11 | a0497a773 |
12 | 500945b85 |
13 | 283b7c433 |
14 | 165ba868d |
15 | c8e36192 |
hex | 80489855 |
2152241237 has 4 divisors (see below), whose sum is σ = 2163392940. Its totient is φ = 2141089536.
The previous prime is 2152241227. The next prime is 2152241257. The reversal of 2152241237 is 7321422512.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1318706596 + 833534641 = 36314^2 + 28871^2 .
It is a cyclic number.
It is not a de Polignac number, because 2152241237 - 220 = 2151192661 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 (2152241227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5575562 + ... + 5575947.
It is an arithmetic number, because the mean of its divisors is an integer number (540848235).
Almost surely, 22152241237 is an apocalyptic number.
It is an amenable number.
2152241237 is a deficient number, since it is larger than the sum of its proper divisors (11151703).
2152241237 is a wasteful number, since it uses less digits than its factorization.
2152241237 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11151702.
The product of its digits is 6720, while the sum is 29.
The square root of 2152241237 is about 46392.2540625049. The cubic root of 2152241237 is about 1291.1112026647. Note that the first 3 decimals are identical.
Adding to 2152241237 its reverse (7321422512), we get a palindrome (9473663749).
The spelling of 2152241237 in words is "two billion, one hundred fifty-two million, two hundred forty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •