Base | Representation |
---|---|
bin | 11011011111100… |
… | …10011110100100 |
3 | 121001222021201012 |
4 | 31233302132210 |
5 | 433020200312 |
6 | 34515121352 |
7 | 5500222361 |
oct | 1557623644 |
9 | 531867635 |
10 | 230631332 |
11 | 109204808 |
12 | 652a3258 |
13 | 38a20759 |
14 | 228b7468 |
15 | 153aa322 |
hex | dbf27a4 |
230631332 has 6 divisors (see below), whose sum is σ = 403604838. Its totient is φ = 115315664.
The previous prime is 230631311. The next prime is 230631337. The reversal of 230631332 is 233136032.
It can be written as a sum of positive squares in only one way, i.e., 230310976 + 320356 = 15176^2 + 566^2 .
It is a super-2 number, since 2×2306313322 = 106381622600188448, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230631298 and 230631307.
It is not an unprimeable number, because it can be changed into a prime (230631337) 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 as a sum of consecutive naturals, namely, 28828913 + ... + 28828920.
It is an arithmetic number, because the mean of its divisors is an integer number (67267473).
Almost surely, 2230631332 is an apocalyptic number.
It is an amenable number.
230631332 is a deficient number, since it is larger than the sum of its proper divisors (172973506).
230631332 is a wasteful number, since it uses less digits than its factorization.
230631332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57657837 (or 57657835 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 23.
The square root of 230631332 is about 15186.5510238500. The cubic root of 230631332 is about 613.2526530873.
Adding to 230631332 its reverse (233136032), we get a palindrome (463767364).
The spelling of 230631332 in words is "two hundred thirty million, six hundred thirty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •