Base | Representation |
---|---|
bin | 1001011011100101… |
… | …1100011100011000 |
3 | 20112102201200201122 |
4 | 2112321130130120 |
5 | 20141100003422 |
6 | 1055113504412 |
7 | 116510410610 |
oct | 22671343430 |
9 | 6472650648 |
10 | 2531641112 |
11 | 108a055490 |
12 | 5a7a12108 |
13 | 31465a3c0 |
14 | 1a0329a40 |
15 | ec3cad42 |
hex | 96e5c718 |
2531641112 has 64 divisors (see below), whose sum is σ = 6373382400. Its totient is φ = 910477440.
The previous prime is 2531641103. The next prime is 2531641117. The reversal of 2531641112 is 2111461352.
2531641112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2531641117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 150062 + ... + 166077.
It is an arithmetic number, because the mean of its divisors is an integer number (99584100).
Almost surely, 22531641112 is an apocalyptic number.
2531641112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2531641112 is an abundant number, since it is smaller than the sum of its proper divisors (3841741288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2531641112 is a wasteful number, since it uses less digits than its factorization.
2531641112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316176 (or 316172 counting only the distinct ones).
The product of its digits is 1440, while the sum is 26.
The square root of 2531641112 is about 50315.4162459181. The cubic root of 2531641112 is about 1362.9106333716.
The spelling of 2531641112 in words is "two billion, five hundred thirty-one million, six hundred forty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •