Base | Representation |
---|---|
bin | 111100100010000… |
… | …0010100010110011 |
3 | 12020112212200022212 |
4 | 1321010002202303 |
5 | 13124430232011 |
6 | 533313322335 |
7 | 101222040362 |
oct | 17104024263 |
9 | 5215780285 |
10 | 2031102131 |
11 | 952560103 |
12 | 4882663ab |
13 | 264a46ba6 |
14 | 153a737d9 |
15 | bd4a808b |
hex | 791028b3 |
2031102131 has 4 divisors (see below), whose sum is σ = 2045927832. Its totient is φ = 2016276432.
The previous prime is 2031102107. The next prime is 2031102137. The reversal of 2031102131 is 1312011302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2031102131 - 214 = 2031085747 is a prime.
It is a super-2 number, since 2×20311021312 = 8250751733105482322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2031102137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7412645 + ... + 7412918.
It is an arithmetic number, because the mean of its divisors is an integer number (511481958).
Almost surely, 22031102131 is an apocalyptic number.
2031102131 is a deficient number, since it is larger than the sum of its proper divisors (14825701).
2031102131 is a wasteful number, since it uses less digits than its factorization.
2031102131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14825700.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2031102131 is about 45067.7504541773. The cubic root of 2031102131 is about 1266.4185227745.
Adding to 2031102131 its reverse (1312011302), we get a palindrome (3343113433).
The spelling of 2031102131 in words is "two billion, thirty-one million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •