Base | Representation |
---|---|
bin | 110100011100001000111111… |
… | …100011011001001101001101 |
3 | 1010020121020001221222201101110 |
4 | 310130020333203121031031 |
5 | 220212134241321303001 |
6 | 2134302551303402233 |
7 | 66402425262146616 |
oct | 6434107743311515 |
9 | 1106536057881343 |
10 | 230632220103501 |
11 | 67539636751607 |
12 | 21a4a09ba53379 |
13 | 9b8c6a9670618 |
14 | 40d4932490c0d |
15 | 1b9e41769d3d6 |
hex | d1c23f8d934d |
230632220103501 has 64 divisors (see below), whose sum is σ = 330461465241600. Its totient is φ = 142722856894464.
The previous prime is 230632220103473. The next prime is 230632220103529. The reversal of 230632220103501 is 105301022236032.
It is an interprime number because it is at equal distance from previous prime (230632220103473) and next prime (230632220103529).
It is not a de Polignac number, because 230632220103501 - 223 = 230632211714893 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230632220103001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1551865485 + ... + 1552014093.
It is an arithmetic number, because the mean of its divisors is an integer number (5163460394400).
Almost surely, 2230632220103501 is an apocalyptic number.
It is an amenable number.
230632220103501 is a deficient number, since it is larger than the sum of its proper divisors (99829245138099).
230632220103501 is a wasteful number, since it uses less digits than its factorization.
230632220103501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152050.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 230632220103501 its reverse (105301022236032), we get a palindrome (335933242339533).
The spelling of 230632220103501 in words is "two hundred thirty trillion, six hundred thirty-two billion, two hundred twenty million, one hundred three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.337 sec. • engine limits •