Base | Representation |
---|---|
bin | 110100011100010001010011… |
… | …111100110010111101011101 |
3 | 1010020122002010110101100020101 |
4 | 310130101103330302331131 |
5 | 220212311034433212001 |
6 | 2134311025502221101 |
7 | 66403162522110361 |
oct | 6434212374627535 |
9 | 1106562113340211 |
10 | 230641152241501 |
11 | 675423aa702041 |
12 | 21a4b973284791 |
13 | 9b904a1050291 |
14 | 40d513c87d2a1 |
15 | 1b9e78b922a01 |
hex | d1c453f32f5d |
230641152241501 has 2 divisors, whose sum is σ = 230641152241502. Its totient is φ = 230641152241500.
The previous prime is 230641152241481. The next prime is 230641152241529. The reversal of 230641152241501 is 105142251146032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 170446054139001 + 60195098102500 = 13055499^2 + 7758550^2 .
It is a cyclic number.
It is not a de Polignac number, because 230641152241501 - 229 = 230640615370589 is a prime.
It is a super-2 number, since 2×2306411522415012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230641152241541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115320576120750 + 115320576120751.
It is an arithmetic number, because the mean of its divisors is an integer number (115320576120751).
Almost surely, 2230641152241501 is an apocalyptic number.
It is an amenable number.
230641152241501 is a deficient number, since it is larger than the sum of its proper divisors (1).
230641152241501 is an equidigital number, since it uses as much as digits as its factorization.
230641152241501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 37.
The spelling of 230641152241501 in words is "two hundred thirty trillion, six hundred forty-one billion, one hundred fifty-two million, two hundred forty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •