Base | Representation |
---|---|
bin | 111100100010000… |
… | …0101001110110101 |
3 | 12020112220020102122 |
4 | 1321010011032311 |
5 | 13124431110031 |
6 | 533313445325 |
7 | 101222114441 |
oct | 17104051665 |
9 | 5215806378 |
10 | 2031113141 |
11 | 952568402 |
12 | 488270845 |
13 | 264a4bbc5 |
14 | 153a77821 |
15 | bd4ab47b |
hex | 791053b5 |
2031113141 has 4 divisors (see below), whose sum is σ = 2119422432. Its totient is φ = 1942803852.
The previous prime is 2031113111. The next prime is 2031113153. The reversal of 2031113141 is 1413111302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1413111302 = 2 ⋅706555651.
It is a cyclic number.
It is not a de Polignac number, because 2031113141 - 214 = 2031096757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031113101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44154611 + ... + 44154656.
It is an arithmetic number, because the mean of its divisors is an integer number (529855608).
Almost surely, 22031113141 is an apocalyptic number.
It is an amenable number.
2031113141 is a deficient number, since it is larger than the sum of its proper divisors (88309291).
2031113141 is an equidigital number, since it uses as much as digits as its factorization.
2031113141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88309290.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 2031113141 is about 45067.8726034411. The cubic root of 2031113141 is about 1266.4208110630.
Adding to 2031113141 its reverse (1413111302), we get a palindrome (3444224443).
The spelling of 2031113141 in words is "two billion, thirty-one million, one hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •