Base | Representation |
---|---|
bin | 11011011110110… |
… | …00010110101101 |
3 | 121001202211221021 |
4 | 31233120112231 |
5 | 433003234313 |
6 | 34512534141 |
7 | 5466265414 |
oct | 1557302655 |
9 | 531684837 |
10 | 230524333 |
11 | 109141386 |
12 | 65251351 |
13 | 389b3b40 |
14 | 2288a47b |
15 | 1538878d |
hex | dbd85ad |
230524333 has 8 divisors (see below), whose sum is σ = 254031008. Its totient is φ = 207842544.
The previous prime is 230524309. The next prime is 230524337. The reversal of 230524333 is 333425032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-230524333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230524298 and 230524307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230524337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205635 + ... + 206752.
It is an arithmetic number, because the mean of its divisors is an integer number (31753876).
Almost surely, 2230524333 is an apocalyptic number.
It is an amenable number.
230524333 is a deficient number, since it is larger than the sum of its proper divisors (23506675).
230524333 is a wasteful number, since it uses less digits than its factorization.
230524333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412443.
The product of its (nonzero) digits is 6480, while the sum is 25.
The square root of 230524333 is about 15183.0277942181. The cubic root of 230524333 is about 613.1578010274.
Adding to 230524333 its reverse (333425032), we get a palindrome (563949365).
The spelling of 230524333 in words is "two hundred thirty million, five hundred twenty-four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •