Base | Representation |
---|---|
bin | 1101011010011001101… |
… | …1101000000110000100 |
3 | 211000202202021120201012 |
4 | 3112212123220012010 |
5 | 12233402413323120 |
6 | 253504522421352 |
7 | 22435105442240 |
oct | 3264633500604 |
9 | 730682246635 |
10 | 230425526660 |
11 | 897a522575a |
12 | 387a9061858 |
13 | 189628c26a4 |
14 | b21cc57420 |
15 | 5ed96051c5 |
hex | 35a66e8184 |
230425526660 has 96 divisors (see below), whose sum is σ = 566989452288. Its totient is φ = 77020692480.
The previous prime is 230425526651. The next prime is 230425526729. The reversal of 230425526660 is 66625524032.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1622930 + ... + 1759190.
It is an arithmetic number, because the mean of its divisors is an integer number (5906140128).
Almost surely, 2230425526660 is an apocalyptic number.
230425526660 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 230425526660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (283494726144).
230425526660 is an abundant number, since it is smaller than the sum of its proper divisors (336563925628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230425526660 is a wasteful number, since it uses less digits than its factorization.
230425526660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136581 (or 136579 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 230425526660 in words is "two hundred thirty billion, four hundred twenty-five million, five hundred twenty-six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •