Base | Representation |
---|---|
bin | 1101011101010111111… |
… | …0100011110010101111 |
3 | 211002211100021020222021 |
4 | 3113111332203302233 |
5 | 12242021120310411 |
6 | 254120015531011 |
7 | 22463632612123 |
oct | 3272576436257 |
9 | 732740236867 |
10 | 231223213231 |
11 | 8a07452645a |
12 | 38990229a67 |
13 | 18a5bc4558a |
14 | b296b7d583 |
15 | 6034671a71 |
hex | 35d5fa3caf |
231223213231 has 4 divisors (see below), whose sum is σ = 231493019472. Its totient is φ = 230953406992.
The previous prime is 231223213229. The next prime is 231223213237. The reversal of 231223213231 is 132312322132.
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 231223213231 - 21 = 231223213229 is a prime.
It is a super-2 number, since 2×2312232132312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231223213196 and 231223213205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231223213237) 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, 134901835 + ... + 134903548.
It is an arithmetic number, because the mean of its divisors is an integer number (57873254868).
Almost surely, 2231223213231 is an apocalyptic number.
231223213231 is a deficient number, since it is larger than the sum of its proper divisors (269806241).
231223213231 is an equidigital number, since it uses as much as digits as its factorization.
231223213231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269806240.
The product of its digits is 2592, while the sum is 25.
Adding to 231223213231 its reverse (132312322132), we get a palindrome (363535535363).
The spelling of 231223213231 in words is "two hundred thirty-one billion, two hundred twenty-three million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •