Base | Representation |
---|---|
bin | 11011011110111… |
… | …11011010001101 |
3 | 121001211022120111 |
4 | 31233133122031 |
5 | 433010200404 |
6 | 34513320021 |
7 | 5466445564 |
oct | 1557373215 |
9 | 531738514 |
10 | 230553229 |
11 | 109161065 |
12 | 65266011 |
13 | 389c403a |
14 | 22896bdb |
15 | 15392104 |
hex | dbdf68d |
230553229 has 4 divisors (see below), whose sum is σ = 235914976. Its totient is φ = 225191484.
The previous prime is 230553227. The next prime is 230553247. The reversal of 230553229 is 922355032.
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 230553229 - 21 = 230553227 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230553229.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230553223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2680809 + ... + 2680894.
It is an arithmetic number, because the mean of its divisors is an integer number (58978744).
Almost surely, 2230553229 is an apocalyptic number.
It is an amenable number.
230553229 is a deficient number, since it is larger than the sum of its proper divisors (5361747).
230553229 is an equidigital number, since it uses as much as digits as its factorization.
230553229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5361746.
The product of its (nonzero) digits is 16200, while the sum is 31.
The square root of 230553229 is about 15183.9793532526. The cubic root of 230553229 is about 613.1834195342.
The spelling of 230553229 in words is "two hundred thirty million, five hundred fifty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •