Base | Representation |
---|---|
bin | 111100100010011… |
… | …0011001001101111 |
3 | 12020120020210102221 |
4 | 1321010303021233 |
5 | 13130003114411 |
6 | 533321500211 |
7 | 101223530011 |
oct | 17104631157 |
9 | 5216223387 |
10 | 2031301231 |
11 | 952686753 |
12 | 488341667 |
13 | 264ab66bb |
14 | 153ac61b1 |
15 | bd4e7071 |
hex | 7913326f |
2031301231 has 4 divisors (see below), whose sum is σ = 2031716464. Its totient is φ = 2030886000.
The previous prime is 2031301183. The next prime is 2031301241. The reversal of 2031301231 is 1321031302.
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 2031301231 - 211 = 2031299183 is a prime.
It is a super-2 number, since 2×20313012312 = 8252369382124230722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031301241) 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 3 ways as a sum of consecutive naturals, for example, 200190 + ... + 210091.
It is an arithmetic number, because the mean of its divisors is an integer number (507929116).
Almost surely, 22031301231 is an apocalyptic number.
2031301231 is a deficient number, since it is larger than the sum of its proper divisors (415233).
2031301231 is an equidigital number, since it uses as much as digits as its factorization.
2031301231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415232.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2031301231 is about 45069.9592966313. The cubic root of 2031301231 is about 1266.4599018999.
Adding to 2031301231 its reverse (1321031302), we get a palindrome (3352332533).
The spelling of 2031301231 in words is "two billion, thirty-one million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •