Base | Representation |
---|---|
bin | 1101011010110111100… |
… | …0011100000110100100 |
3 | 211001002110110220122121 |
4 | 3112231320130012210 |
5 | 12234131413121403 |
6 | 253525145435324 |
7 | 22441154042050 |
oct | 3265570340644 |
9 | 731073426577 |
10 | 230550520228 |
11 | 89859838226 |
12 | 38822a9bb44 |
13 | 18982777492 |
14 | b2316b2c60 |
15 | 5ee55953bd |
hex | 35ade1c1a4 |
230550520228 has 24 divisors (see below), whose sum is σ = 461157670400. Its totient is φ = 98795230848.
The previous prime is 230550520223. The next prime is 230550520243. The reversal of 230550520228 is 822025055032.
230550520228 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 230550520193 and 230550520202.
It is not an unprimeable number, because it can be changed into a prime (230550520223) 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, 271668 + ... + 731371.
Almost surely, 2230550520228 is an apocalyptic number.
230550520228 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
230550520228 is an abundant number, since it is smaller than the sum of its proper divisors (230607150172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230550520228 is a wasteful number, since it uses less digits than its factorization.
230550520228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011259 (or 1011257 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 34.
The spelling of 230550520228 in words is "two hundred thirty billion, five hundred fifty million, five hundred twenty thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •