Base | Representation |
---|---|
bin | 110100010110000010100101… |
… | …010010110010100110100101 |
3 | 1010012010011001012110211020111 |
4 | 310112002211102302212211 |
5 | 220133302231134411401 |
6 | 2133342222415333021 |
7 | 66330225152062264 |
oct | 6426024522624645 |
9 | 1105104035424214 |
10 | 230213020232101 |
11 | 673978803096a5 |
12 | 219a09aa821171 |
13 | 9b5bcc1353c3a |
14 | 40bc5263a65db |
15 | 1b935803d8e51 |
hex | d160a54b29a5 |
230213020232101 has 2 divisors, whose sum is σ = 230213020232102. Its totient is φ = 230213020232100.
The previous prime is 230213020232099. The next prime is 230213020232137. The reversal of 230213020232101 is 101232020312032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 222465398495076 + 7747621737025 = 14915274^2 + 2783455^2 .
It is a cyclic number.
It is not a de Polignac number, because 230213020232101 - 21 = 230213020232099 is a prime.
Together with 230213020232099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230213020212101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115106510116050 + 115106510116051.
It is an arithmetic number, because the mean of its divisors is an integer number (115106510116051).
Almost surely, 2230213020232101 is an apocalyptic number.
It is an amenable number.
230213020232101 is a deficient number, since it is larger than the sum of its proper divisors (1).
230213020232101 is an equidigital number, since it uses as much as digits as its factorization.
230213020232101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 230213020232101 its reverse (101232020312032), we get a palindrome (331445040544133).
The spelling of 230213020232101 in words is "two hundred thirty trillion, two hundred thirteen billion, twenty million, two hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •