Base | Representation |
---|---|
bin | 110100110010111110001110… |
… | …101010100000001101110011 |
3 | 1010110011012220121002120202201 |
4 | 310302332032222200031303 |
5 | 220413341034332232243 |
6 | 2141503432523324031 |
7 | 66623661312655351 |
oct | 6462761652401563 |
9 | 1113135817076681 |
10 | 232201210430323 |
11 | 67a93a868a6622 |
12 | 22062197680617 |
13 | 9c74631c88504 |
14 | 414a8545c87d1 |
15 | 1bca1466b604d |
hex | d32f8eaa0373 |
232201210430323 has 16 divisors (see below), whose sum is σ = 233175753769824. Its totient is φ = 231227677175040.
The previous prime is 232201210430251. The next prime is 232201210430447. The reversal of 232201210430323 is 323034012102232.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232201210430323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232201210430291 and 232201210430300.
It is not an unprimeable number, because it can be changed into a prime (232201210437323) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5420048383 + ... + 5420091223.
It is an arithmetic number, because the mean of its divisors is an integer number (14573484610614).
Almost surely, 2232201210430323 is an apocalyptic number.
232201210430323 is a deficient number, since it is larger than the sum of its proper divisors (974543339501).
232201210430323 is a wasteful number, since it uses less digits than its factorization.
232201210430323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54102.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 232201210430323 its reverse (323034012102232), we get a palindrome (555235222532555).
The spelling of 232201210430323 in words is "two hundred thirty-two trillion, two hundred one billion, two hundred ten million, four hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •