Base | Representation |
---|---|
bin | 110100011100110000111110… |
… | …110101000111100001111101 |
3 | 1010020202022220100112211212102 |
4 | 310130300332311013201331 |
5 | 220213340210324123222 |
6 | 2134334412100114445 |
7 | 66405505306220621 |
oct | 6434607665074175 |
9 | 1106668810484772 |
10 | 230675157645437 |
11 | 6755586a89035a |
12 | 21a56483695a25 |
13 | 9b937601a967b |
14 | 40d6a46c47181 |
15 | 1ba05cbedcd92 |
hex | d1cc3ed4787d |
230675157645437 has 2 divisors, whose sum is σ = 230675157645438. Its totient is φ = 230675157645436.
The previous prime is 230675157645403. The next prime is 230675157645463. The reversal of 230675157645437 is 734546751576032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131205432796036 + 99469724849401 = 11454494^2 + 9973451^2 .
It is a cyclic number.
It is not a de Polignac number, because 230675157645437 - 222 = 230675153451133 is a prime.
It is a super-2 number, since 2×2306751576454372 (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 (230675157645137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115337578822718 + 115337578822719.
It is an arithmetic number, because the mean of its divisors is an integer number (115337578822719).
Almost surely, 2230675157645437 is an apocalyptic number.
It is an amenable number.
230675157645437 is a deficient number, since it is larger than the sum of its proper divisors (1).
230675157645437 is an equidigital number, since it uses as much as digits as its factorization.
230675157645437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 444528000, while the sum is 65.
The spelling of 230675157645437 in words is "two hundred thirty trillion, six hundred seventy-five billion, one hundred fifty-seven million, six hundred forty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •