Base | Representation |
---|---|
bin | 1000011001000011… |
… | …0010111111110011 |
3 | 12210222120101212122 |
4 | 2012100302333303 |
5 | 14103123101011 |
6 | 1011303544455 |
7 | 106551234356 |
oct | 20620627763 |
9 | 5728511778 |
10 | 2252550131 |
11 | a56562287 |
12 | 52a45b12b |
13 | 29b8a0700 |
14 | 17523a29d |
15 | d2b4c3db |
hex | 86432ff3 |
2252550131 has 12 divisors (see below), whose sum is σ = 2442808440. Its totient is φ = 2076160320.
The previous prime is 2252550119. The next prime is 2252550137. The reversal of 2252550131 is 1310552522.
It is not a de Polignac number, because 2252550131 - 210 = 2252549107 is a prime.
It is a super-2 number, since 2×22525501312 = 10147964185336234322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2252550131.
It is not an unprimeable number, because it can be changed into a prime (2252550137) 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 11 ways as a sum of consecutive naturals, for example, 107135 + ... + 126423.
It is an arithmetic number, because the mean of its divisors is an integer number (203567370).
Almost surely, 22252550131 is an apocalyptic number.
2252550131 is a deficient number, since it is larger than the sum of its proper divisors (190258309).
2252550131 is a wasteful number, since it uses less digits than its factorization.
2252550131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20006 (or 19993 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 2252550131 is about 47461.0380312104. The cubic root of 2252550131 is about 1310.8655645529.
The spelling of 2252550131 in words is "two billion, two hundred fifty-two million, five hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •