Base | Representation |
---|---|
bin | 11011011110111… |
… | …11100111000101 |
3 | 121001211100201000 |
4 | 31233133213011 |
5 | 433010212203 |
6 | 34513323513 |
7 | 5466451152 |
oct | 1557374705 |
9 | 531740630 |
10 | 230554053 |
11 | 109161744 |
12 | 65266599 |
13 | 389c4522 |
14 | 22897229 |
15 | 153924a3 |
hex | dbdf9c5 |
230554053 has 8 divisors (see below), whose sum is σ = 341561600. Its totient is φ = 153702684.
The previous prime is 230554043. The next prime is 230554073. The reversal of 230554053 is 350455032.
It is a de Polignac number, because none of the positive numbers 2k-230554053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 8539039 = 230554053 / (2 + 3 + 0 + 5 + 5 + 4 + 0 + 5 + 3).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230554033) 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 7 ways as a sum of consecutive naturals, for example, 4269493 + ... + 4269546.
It is an arithmetic number, because the mean of its divisors is an integer number (42695200).
Almost surely, 2230554053 is an apocalyptic number.
It is an amenable number.
230554053 is a deficient number, since it is larger than the sum of its proper divisors (111007547).
230554053 is an equidigital number, since it uses as much as digits as its factorization.
230554053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8539048 (or 8539042 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 27.
The square root of 230554053 is about 15184.0064870903. The cubic root of 230554053 is about 613.1841500416.
The spelling of 230554053 in words is "two hundred thirty million, five hundred fifty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •