Base | Representation |
---|---|
bin | 111100100010010… |
… | …0111011001101101 |
3 | 12020120011100102100 |
4 | 1321010213121231 |
5 | 13130000044401 |
6 | 533320445313 |
7 | 101223236463 |
oct | 17104473155 |
9 | 5216140370 |
10 | 2031253101 |
11 | 952653579 |
12 | 488319839 |
13 | 264a9a817 |
14 | 153ab2833 |
15 | bd4d7b86 |
hex | 7912766d |
2031253101 has 24 divisors (see below), whose sum is σ = 2950155000. Its totient is φ = 1346752512.
The previous prime is 2031253087. The next prime is 2031253123. The reversal of 2031253101 is 1013521302.
It can be written as a sum of positive squares in 4 ways, for example, as 1489574025 + 541679076 = 38595^2 + 23274^2 .
It is not a de Polignac number, because 2031253101 - 230 = 957511277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031253151) 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 23 ways as a sum of consecutive naturals, for example, 1652155 + ... + 1653383.
It is an arithmetic number, because the mean of its divisors is an integer number (122923125).
Almost surely, 22031253101 is an apocalyptic number.
It is an amenable number.
2031253101 is a deficient number, since it is larger than the sum of its proper divisors (918901899).
2031253101 is a wasteful number, since it uses less digits than its factorization.
2031253101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2093 (or 2090 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 2031253101 is about 45069.4253457929. The cubic root of 2031253101 is about 1266.4498992482.
Adding to 2031253101 its reverse (1013521302), we get a palindrome (3044774403).
The spelling of 2031253101 in words is "two billion, thirty-one million, two hundred fifty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •