Base | Representation |
---|---|
bin | 110100110100101110000101… |
… | …110000001111001111100011 |
3 | 1010110120200221020111002011121 |
4 | 310310232011300033033203 |
5 | 220422323030411214021 |
6 | 2142034535132553111 |
7 | 66635442612445102 |
oct | 6464560560171743 |
9 | 1113520836432147 |
10 | 232321320023011 |
11 | 6802aa1160430a |
12 | 22081518022797 |
13 | 9c82a63a9470b |
14 | 41525aa2dc039 |
15 | 1bcd3260b8741 |
hex | d34b85c0f3e3 |
232321320023011 has 4 divisors (see below), whose sum is σ = 232322769302400. Its totient is φ = 232319870743624.
The previous prime is 232321320023003. The next prime is 232321320023027. The reversal of 232321320023011 is 110320023123232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 232321320023011 - 23 = 232321320023003 is a prime.
It is a super-2 number, since 2×2323213200230112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (232321320023711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 724399216 + ... + 724719853.
It is an arithmetic number, because the mean of its divisors is an integer number (58080692325600).
Almost surely, 2232321320023011 is an apocalyptic number.
232321320023011 is a deficient number, since it is larger than the sum of its proper divisors (1449279389).
232321320023011 is a wasteful number, since it uses less digits than its factorization.
232321320023011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449279388.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 232321320023011 its reverse (110320023123232), we get a palindrome (342641343146243).
The spelling of 232321320023011 in words is "two hundred thirty-two trillion, three hundred twenty-one billion, three hundred twenty million, twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •