Base | Representation |
---|---|
bin | 110100110100100101011010… |
… | …010001001111011100110000 |
3 | 1010110112210212202020102022012 |
4 | 310310211122101033130300 |
5 | 220422144434114330022 |
6 | 2142030354300102052 |
7 | 66634662640251032 |
oct | 6464453221173460 |
9 | 1113483782212265 |
10 | 232312000542512 |
11 | 68026a69a43710 |
12 | 2207b756b34928 |
13 | 9c81c0a085807 |
14 | 4151d646c1c52 |
15 | 1bcce7cd30de2 |
hex | d3495a44f730 |
232312000542512 has 40 divisors (see below), whose sum is σ = 491507814142800. Its totient is φ = 105492122574080.
The previous prime is 232312000542451. The next prime is 232312000542529. The reversal of 232312000542512 is 215245000213232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 651329387 + ... + 651685962.
It is an arithmetic number, because the mean of its divisors is an integer number (12287695353570).
Almost surely, 2232312000542512 is an apocalyptic number.
232312000542512 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
232312000542512 is an abundant number, since it is smaller than the sum of its proper divisors (259195813600288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232312000542512 is a wasteful number, since it uses less digits than its factorization.
232312000542512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1303016381 (or 1303016375 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 232312000542512 its reverse (215245000213232), we get a palindrome (447557000755744).
The spelling of 232312000542512 in words is "two hundred thirty-two trillion, three hundred twelve billion, five hundred forty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •