Base | Representation |
---|---|
bin | 11011011110010… |
… | …10001111100101 |
3 | 121001122220122112 |
4 | 31233022033211 |
5 | 432444412113 |
6 | 34511410405 |
7 | 5465635043 |
oct | 1557121745 |
9 | 531586575 |
10 | 230466533 |
11 | 109101a10 |
12 | 65223a05 |
13 | 3899373b |
14 | 22873393 |
15 | 153765a8 |
hex | dbca3e5 |
230466533 has 8 divisors (see below), whose sum is σ = 255171360. Its totient is φ = 206387280.
The previous prime is 230466529. The next prime is 230466559. The reversal of 230466533 is 335664032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 230466533 - 22 = 230466529 is a prime.
It is a super-2 number, since 2×2304665332 = 106229645666080178, which contains 22 as substring.
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 230466533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230466503) 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, 155618 + ... + 157091.
It is an arithmetic number, because the mean of its divisors is an integer number (31896420).
Almost surely, 2230466533 is an apocalyptic number.
It is an amenable number.
230466533 is a deficient number, since it is larger than the sum of its proper divisors (24704827).
230466533 is a wasteful number, since it uses less digits than its factorization.
230466533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312787.
The product of its (nonzero) digits is 38880, while the sum is 32.
The square root of 230466533 is about 15181.1242337318. The cubic root of 230466533 is about 613.1065504965.
The spelling of 230466533 in words is "two hundred thirty million, four hundred sixty-six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •