Base | Representation |
---|---|
bin | 11011011100110… |
… | …10101001000000 |
3 | 121001022000012000 |
4 | 31232122221000 |
5 | 432422142202 |
6 | 34503304000 |
7 | 5464163430 |
oct | 1556325100 |
9 | 531260160 |
10 | 230271552 |
11 | 108a89475 |
12 | 6514b000 |
13 | 38925a74 |
14 | 228222c0 |
15 | 1533891c |
hex | db9aa40 |
230271552 has 112 divisors (see below), whose sum is σ = 773704320. Its totient is φ = 65788416.
The previous prime is 230271551. The next prime is 230271577. The reversal of 230271552 is 255172032.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (230271551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2578 + ... + 21614.
Almost surely, 2230271552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 230271552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (386852160).
230271552 is an abundant number, since it is smaller than the sum of its proper divisors (543432768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230271552 is a wasteful number, since it uses less digits than its factorization.
230271552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19065 (or 19049 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 230271552 is about 15174.7010514211. The cubic root of 230271552 is about 612.9336000683.
The spelling of 230271552 in words is "two hundred thirty million, two hundred seventy-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •