Base | Representation |
---|---|
bin | 1101011001111100100… |
… | …1000111010011010000 |
3 | 211000110020011102122222 |
4 | 3112133021013103100 |
5 | 12233130111430412 |
6 | 253444433320212 |
7 | 22432062116522 |
oct | 3263711072320 |
9 | 730406142588 |
10 | 230303233232 |
11 | 89742197906 |
12 | 38774106068 |
13 | 18943474907 |
14 | b20a901a12 |
15 | 5ecd9ea072 |
hex | 359f2474d0 |
230303233232 has 20 divisors (see below), whose sum is σ = 450630463236. Its totient is φ = 114011500800.
The previous prime is 230303233213. The next prime is 230303233241. The reversal of 230303233232 is 232332303032.
It is a happy number.
230303233232 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 100086180496 + 130217052736 = 316364^2 + 360856^2 .
It is a super-2 number, since 2×2303032332322 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 71255573 + ... + 71258804.
Almost surely, 2230303233232 is an apocalyptic number.
It is an amenable number.
230303233232 is a deficient number, since it is larger than the sum of its proper divisors (220327230004).
230303233232 is a wasteful number, since it uses less digits than its factorization.
230303233232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142514486 (or 142514480 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 26.
Adding to 230303233232 its reverse (232332303032), we get a palindrome (462635536264).
The spelling of 230303233232 in words is "two hundred thirty billion, three hundred three million, two hundred thirty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •