Base | Representation |
---|---|
bin | 110100110111011000011011… |
… | …000011100011111010011110 |
3 | 1010111020012000101212101010112 |
4 | 310313120123003203322132 |
5 | 220433322112130120110 |
6 | 2142254543335210022 |
7 | 66654606104512424 |
oct | 6467303303437236 |
9 | 1114205011771115 |
10 | 232504213520030 |
11 | 680a0535183641 |
12 | 220b0a5a816912 |
13 | 9c97090010a7a |
14 | 415b39a4d9114 |
15 | 1bd2e7c829405 |
hex | d3761b0e3e9e |
232504213520030 has 16 divisors (see below), whose sum is σ = 424753966193040. Its totient is φ = 91613600550912.
The previous prime is 232504213520021. The next prime is 232504213520039. The reversal of 232504213520030 is 30025312405232.
It is an interprime number because it is at equal distance from previous prime (232504213520021) and next prime (232504213520039).
It is a super-2 number, since 2×2325042135200302 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232504213520039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173510606435 + ... + 173510607774.
It is an arithmetic number, because the mean of its divisors is an integer number (26547122887065).
Almost surely, 2232504213520030 is an apocalyptic number.
232504213520030 is a deficient number, since it is larger than the sum of its proper divisors (192249752673010).
232504213520030 is a wasteful number, since it uses less digits than its factorization.
232504213520030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347021214283.
The product of its (nonzero) digits is 43200, while the sum is 32.
Adding to 232504213520030 its reverse (30025312405232), we get a palindrome (262529525925262).
The spelling of 232504213520030 in words is "two hundred thirty-two trillion, five hundred four billion, two hundred thirteen million, five hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •