Base | Representation |
---|---|
bin | 111110111110101… |
… | …0111110001000010 |
3 | 12110021102201110222 |
4 | 1331331113301002 |
5 | 13311442141010 |
6 | 545410023042 |
7 | 103240146641 |
oct | 17575276102 |
9 | 5407381428 |
10 | 2113240130 |
11 | 994961651 |
12 | 4ab877a82 |
13 | 278a75461 |
14 | 160935358 |
15 | c57d0355 |
hex | 7df57c42 |
2113240130 has 8 divisors (see below), whose sum is σ = 3803832252. Its totient is φ = 845296048.
The previous prime is 2113240127. The next prime is 2113240133. The reversal of 2113240130 is 310423112.
It is an interprime number because it is at equal distance from previous prime (2113240127) and next prime (2113240133).
It can be written as a sum of positive squares in 2 ways, for example, as 2083831201 + 29408929 = 45649^2 + 5423^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2113240099 and 2113240108.
It is not an unprimeable number, because it can be changed into a prime (2113240133) 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 3 ways as a sum of consecutive naturals, for example, 105661997 + ... + 105662016.
Almost surely, 22113240130 is an apocalyptic number.
2113240130 is a deficient number, since it is larger than the sum of its proper divisors (1690592122).
2113240130 is a wasteful number, since it uses less digits than its factorization.
2113240130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211324020.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2113240130 is about 45969.9916249720. The cubic root of 2113240130 is about 1283.2648040466.
Adding to 2113240130 its reverse (310423112), we get a palindrome (2423663242).
The spelling of 2113240130 in words is "two billion, one hundred thirteen million, two hundred forty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •