Base | Representation |
---|---|
bin | 1101011101011010010… |
… | …0010100000001110101 |
3 | 211002212000220001222012 |
4 | 3113112210110001311 |
5 | 12242031134011013 |
6 | 254121012014005 |
7 | 22464113002064 |
oct | 3272644240165 |
9 | 732760801865 |
10 | 231233110133 |
11 | 8a07a076113 |
12 | 38993601305 |
13 | 18a60ccc22c |
14 | b2981d81db |
15 | 60354791a8 |
hex | 35d6914075 |
231233110133 has 4 divisors (see below), whose sum is σ = 231899488320. Its totient is φ = 230566731948.
The previous prime is 231233110081. The next prime is 231233110151. The reversal of 231233110133 is 331011332132.
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 231233110133 - 212 = 231233106037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231233110099 and 231233110108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231233110153) 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, 333188573 + ... + 333189266.
It is an arithmetic number, because the mean of its divisors is an integer number (57974872080).
Almost surely, 2231233110133 is an apocalyptic number.
It is an amenable number.
231233110133 is a deficient number, since it is larger than the sum of its proper divisors (666378187).
231233110133 is an equidigital number, since it uses as much as digits as its factorization.
231233110133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 666378186.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 231233110133 its reverse (331011332132), we get a palindrome (562244442265).
The spelling of 231233110133 in words is "two hundred thirty-one billion, two hundred thirty-three million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •