Base | Representation |
---|---|
bin | 1000001110001101… |
… | …1101101110001011 |
3 | 12200211001220120200 |
4 | 2003203131232023 |
5 | 14010010041300 |
6 | 1003002023243 |
7 | 105460100040 |
oct | 20343355613 |
9 | 5624056520 |
10 | 2207112075 |
11 | a32947a73 |
12 | 5171a7b23 |
13 | 29235189c |
14 | 16d1ad1c7 |
15 | cdb74200 |
hex | 838ddb8b |
2207112075 has 72 divisors (see below), whose sum is σ = 4535471616. Its totient is φ = 1005048000.
The previous prime is 2207112073. The next prime is 2207112079. The reversal of 2207112075 is 5702117022.
It is not a de Polignac number, because 2207112075 - 21 = 2207112073 is a prime.
It is a super-2 number, since 2×22071120752 = 9742687423221611250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2207112071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 424240 + ... + 429410.
Almost surely, 22207112075 is an apocalyptic number.
2207112075 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2207112075 is an abundant number, since it is smaller than the sum of its proper divisors (2328359541).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2207112075 is a wasteful number, since it uses less digits than its factorization.
2207112075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5465 (or 5457 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 2207112075 is about 46979.9113983839. The cubic root of 2207112075 is about 1301.9914399120.
Adding to 2207112075 its reverse (5702117022), we get a palindrome (7909229097).
The spelling of 2207112075 in words is "two billion, two hundred seven million, one hundred twelve thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •