Base | Representation |
---|---|
bin | 1011101011000000… |
… | …1110001100011111 |
3 | 22002100200012211010 |
4 | 2322300032030133 |
5 | 22404100000411 |
6 | 1234523230303 |
7 | 140433534204 |
oct | 27260161437 |
9 | 8070605733 |
10 | 3133203231 |
11 | 136867aa64 |
12 | 735378393 |
13 | 3ac182012 |
14 | 21a19bcab |
15 | 1351067a6 |
hex | bac0e31f |
3133203231 has 16 divisors (see below), whose sum is σ = 4294993248. Its totient is φ = 2030476800.
The previous prime is 3133203217. The next prime is 3133203251. The reversal of 3133203231 is 1323023313.
It is not a de Polignac number, because 3133203231 - 27 = 3133203103 is a prime.
It is a super-2 number, since 2×31332032312 = 19633924973497678722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3133203198 and 3133203207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3133203251) 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 15 ways as a sum of consecutive naturals, for example, 11910 + ... + 80051.
It is an arithmetic number, because the mean of its divisors is an integer number (268437078).
Almost surely, 23133203231 is an apocalyptic number.
3133203231 is a deficient number, since it is larger than the sum of its proper divisors (1161790017).
3133203231 is a wasteful number, since it uses less digits than its factorization.
3133203231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92282.
The product of its (nonzero) digits is 972, while the sum is 21.
The square root of 3133203231 is about 55975.0232782444. The cubic root of 3133203231 is about 1463.2870256475.
Adding to 3133203231 its reverse (1323023313), we get a palindrome (4456226544).
The spelling of 3133203231 in words is "three billion, one hundred thirty-three million, two hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •