Base | Representation |
---|---|
bin | 110100110000001100011100… |
… | …010010101011011101110100 |
3 | 1010102110222011121221102122110 |
4 | 310300030130102223131310 |
5 | 220402224110113140200 |
6 | 2141240022201331020 |
7 | 66604122561525432 |
oct | 6460143422533564 |
9 | 1112428147842573 |
10 | 232010313021300 |
11 | 67a20026227790 |
12 | 220311a0496a70 |
13 | 9c5c62b759558 |
14 | 41415053c5d52 |
15 | 1bc51c2435b50 |
hex | d3031c4ab774 |
232010313021300 has 144 divisors (see below), whose sum is σ = 732374167053312. Its totient is φ = 56239912713600.
The previous prime is 232010313021299. The next prime is 232010313021317. The reversal of 232010313021300 is 3120313010232.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 33975237 + ... + 40228563.
It is an arithmetic number, because the mean of its divisors is an integer number (5085931715648).
Almost surely, 2232010313021300 is an apocalyptic number.
232010313021300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
232010313021300 is an abundant number, since it is smaller than the sum of its proper divisors (500363854032012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232010313021300 is a wasteful number, since it uses less digits than its factorization.
232010313021300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6264598 (or 6264591 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 232010313021300 its reverse (3120313010232), we get a palindrome (235130626031532).
The spelling of 232010313021300 in words is "two hundred thirty-two trillion, ten billion, three hundred thirteen million, twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •