Base | Representation |
---|---|
bin | 110100110100111000011100… |
… | …000010011110100101000101 |
3 | 1010110121202121121100112010001 |
4 | 310310320130002132211011 |
5 | 220423013304404241123 |
6 | 2142044013454401301 |
7 | 66636315143101063 |
oct | 6464703402364505 |
9 | 1113552547315101 |
10 | 232332431321413 |
11 | 680346a3650255 |
12 | 220836b9200231 |
13 | 9c83b14a8a3b7 |
14 | 4152d41ca1033 |
15 | 1bcd7767e00ad |
hex | d34e1c09e945 |
232332431321413 has 8 divisors (see below), whose sum is σ = 248705546464800. Its totient is φ = 216373825422288.
The previous prime is 232332431321401. The next prime is 232332431321443. The reversal of 232332431321413 is 314123134233232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232332431321413 - 221 = 232332429224261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232332431321443) 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, 103627309906 + ... + 103627312147.
It is an arithmetic number, because the mean of its divisors is an integer number (31088193308100).
Almost surely, 2232332431321413 is an apocalyptic number.
It is an amenable number.
232332431321413 is a deficient number, since it is larger than the sum of its proper divisors (16373115143387).
232332431321413 is a wasteful number, since it uses less digits than its factorization.
232332431321413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207254622131.
The product of its digits is 186624, while the sum is 37.
Adding to 232332431321413 its reverse (314123134233232), we get a palindrome (546455565554645).
The spelling of 232332431321413 in words is "two hundred thirty-two trillion, three hundred thirty-two billion, four hundred thirty-one million, three hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •