Base | Representation |
---|---|
bin | 11011100010101… |
… | …01010101000101 |
3 | 121002201212010101 |
4 | 31301111111011 |
5 | 433121124404 |
6 | 34531524101 |
7 | 5503530004 |
oct | 1561252505 |
9 | 532655111 |
10 | 231036229 |
11 | 109460a36 |
12 | 65459631 |
13 | 38b32b38 |
14 | 22980c3b |
15 | 1543a2a4 |
hex | dc55545 |
231036229 has 2 divisors, whose sum is σ = 231036230. Its totient is φ = 231036228.
The previous prime is 231036217. The next prime is 231036259. The reversal of 231036229 is 922630132.
231036229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 219099204 + 11937025 = 14802^2 + 3455^2 .
It is a cyclic number.
It is not a de Polignac number, because 231036229 - 27 = 231036101 is a prime.
It is a super-2 number, since 2×2310362292 = 106755478221080882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231036197 and 231036206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231036259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115518114 + 115518115.
It is an arithmetic number, because the mean of its divisors is an integer number (115518115).
Almost surely, 2231036229 is an apocalyptic number.
It is an amenable number.
231036229 is a deficient number, since it is larger than the sum of its proper divisors (1).
231036229 is an equidigital number, since it uses as much as digits as its factorization.
231036229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 231036229 is about 15199.8759534412. The cubic root of 231036229 is about 613.6113192915.
The spelling of 231036229 in words is "two hundred thirty-one million, thirty-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •