Base | Representation |
---|---|
bin | 1101011100111011010… |
… | …0110010101001100101 |
3 | 211002111222110120102011 |
4 | 3113032310302221211 |
5 | 12241244410242013 |
6 | 254100051514221 |
7 | 22460644614523 |
oct | 3271664625145 |
9 | 732458416364 |
10 | 231103212133 |
11 | 8a0128138a2 |
12 | 38957bb8971 |
13 | 18a4011b001 |
14 | b284c63313 |
15 | 6028d6ac3d |
hex | 35ced32a65 |
231103212133 has 4 divisors (see below), whose sum is σ = 231118809408. Its totient is φ = 231087614860.
The previous prime is 231103212127. The next prime is 231103212161. The reversal of 231103212133 is 331212301132.
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.
It is a cyclic number.
It is not a de Polignac number, because 231103212133 - 25 = 231103212101 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 (231103212103) 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, 7776391 + ... + 7806052.
It is an arithmetic number, because the mean of its divisors is an integer number (57779702352).
Almost surely, 2231103212133 is an apocalyptic number.
It is an amenable number.
231103212133 is a deficient number, since it is larger than the sum of its proper divisors (15597275).
231103212133 is a wasteful number, since it uses less digits than its factorization.
231103212133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15597274.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 231103212133 its reverse (331212301132), we get a palindrome (562315513265).
The spelling of 231103212133 in words is "two hundred thirty-one billion, one hundred three million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •