Base | Representation |
---|---|
bin | 1001110011010101… |
… | …1110001110100100 |
3 | 20210101012000110101 |
4 | 2130311132032210 |
5 | 20342100410030 |
6 | 1113033033444 |
7 | 122130240052 |
oct | 23465361644 |
9 | 6711160411 |
10 | 2631263140 |
11 | 1130308a40 |
12 | 615255884 |
13 | 32c19ab4c |
14 | 1ad65d1d2 |
15 | 1060087ca |
hex | 9cd5e3a4 |
2631263140 has 48 divisors (see below), whose sum is σ = 6190922304. Its totient is φ = 930960000.
The previous prime is 2631263123. The next prime is 2631263143. The reversal of 2631263140 is 413621362.
It is a junction number, because it is equal to n+sod(n) for n = 2631263099 and 2631263108.
It is not an unprimeable number, because it can be changed into a prime (2631263143) 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 15 ways as a sum of consecutive naturals, for example, 153486 + ... + 169765.
It is an arithmetic number, because the mean of its divisors is an integer number (128977548).
Almost surely, 22631263140 is an apocalyptic number.
2631263140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2631263140 is an abundant number, since it is smaller than the sum of its proper divisors (3559659164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2631263140 is a wasteful number, since it uses less digits than its factorization.
2631263140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323308 (or 323306 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 2631263140 is about 51295.8394024311. The cubic root of 2631263140 is about 1380.5583297023.
The spelling of 2631263140 in words is "two billion, six hundred thirty-one million, two hundred sixty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •