Base | Representation |
---|---|
bin | 11011100100001… |
… | …00101100001111 |
3 | 121010002201020100 |
4 | 31302010230033 |
5 | 433143331343 |
6 | 34540022143 |
7 | 5505265410 |
oct | 1562045417 |
9 | 533081210 |
10 | 231230223 |
11 | 109583764 |
12 | 65531953 |
13 | 38ba0223 |
14 | 229d1807 |
15 | 154779d3 |
hex | dc84b0f |
231230223 has 12 divisors (see below), whose sum is σ = 381713488. Its totient is φ = 132131520.
The previous prime is 231230213. The next prime is 231230267. The reversal of 231230223 is 322032132.
It is a happy number.
231230223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 231230223 - 28 = 231229967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231230196 and 231230205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231230203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1835098 + ... + 1835223.
Almost surely, 2231230223 is an apocalyptic number.
231230223 is a deficient number, since it is larger than the sum of its proper divisors (150483265).
231230223 is a wasteful number, since it uses less digits than its factorization.
231230223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3670334 (or 3670331 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
The square root of 231230223 is about 15206.2560480876. The cubic root of 231230223 is about 613.7830147482.
Adding to 231230223 its reverse (322032132), we get a palindrome (553262355).
It can be divided in two parts, 2312302 and 23, that added together give a triangular number (2312325 = T2150).
The spelling of 231230223 in words is "two hundred thirty-one million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •