Base | Representation |
---|---|
bin | 1101011101101100101… |
… | …0011110011110000001 |
3 | 211010001101222211020221 |
4 | 3113123022132132001 |
5 | 12242210404120413 |
6 | 254132404503041 |
7 | 22466040312445 |
oct | 3273312363601 |
9 | 733041884227 |
10 | 231310223233 |
11 | 8a109655351 |
12 | 389b53aaa81 |
13 | 18a73c8b59b |
14 | b2a454c825 |
15 | 603c10c68d |
hex | 35db29e781 |
231310223233 has 4 divisors (see below), whose sum is σ = 232842079168. Its totient is φ = 229778367300.
The previous prime is 231310223191. The next prime is 231310223237. The reversal of 231310223233 is 332322013132.
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 231310223233 - 213 = 231310215041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231310223198 and 231310223207.
It is not an unprimeable number, because it can be changed into a prime (231310223237) 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, 765927741 + ... + 765928042.
It is an arithmetic number, because the mean of its divisors is an integer number (58210519792).
Almost surely, 2231310223233 is an apocalyptic number.
It is an amenable number.
231310223233 is a deficient number, since it is larger than the sum of its proper divisors (1531855935).
231310223233 is a wasteful number, since it uses less digits than its factorization.
231310223233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1531855934.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 231310223233 its reverse (332322013132), we get a palindrome (563632236365).
The spelling of 231310223233 in words is "two hundred thirty-one billion, three hundred ten million, two hundred twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •