Base | Representation |
---|---|
bin | 11011011100010… |
… | …11111010100000 |
3 | 121001011221102221 |
4 | 31232023322200 |
5 | 432413224412 |
6 | 34502120424 |
7 | 5463522526 |
oct | 1556137240 |
9 | 531157387 |
10 | 230211232 |
11 | 108a48119 |
12 | 65120114 |
13 | 38904484 |
14 | 22808316 |
15 | 15325b07 |
hex | db8bea0 |
230211232 has 48 divisors (see below), whose sum is σ = 474647040. Its totient is φ = 109702912.
The previous prime is 230211221. The next prime is 230211259. The reversal of 230211232 is 232112032.
It is a super-2 number, since 2×2302112322 = 105994422677915648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 352218 + ... + 352870.
It is an arithmetic number, because the mean of its divisors is an integer number (9888480).
Almost surely, 2230211232 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 230211232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237323520).
230211232 is an abundant number, since it is smaller than the sum of its proper divisors (244435808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230211232 is a wasteful number, since it uses less digits than its factorization.
230211232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1165 (or 1157 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 230211232 is about 15172.7134026844. The cubic root of 230211232 is about 612.8800757500.
Adding to 230211232 its reverse (232112032), we get a palindrome (462323264).
The spelling of 230211232 in words is "two hundred thirty million, two hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •