Base | Representation |
---|---|
bin | 110100010100011010010110… |
… | …011001101011100000010101 |
3 | 1010011201110011101010110000021 |
4 | 310110122112121223200111 |
5 | 220124434023403330401 |
6 | 2133214553034545141 |
7 | 66316153536210643 |
oct | 6424322631534025 |
9 | 1104643141113007 |
10 | 230101101230101 |
11 | 67354368a14a22 |
12 | 219831752981b1 |
13 | 9b515963cc3ba |
14 | 40b6d4a3b0193 |
15 | 1b906ceacd2a1 |
hex | d1469666b815 |
230101101230101 has 2 divisors, whose sum is σ = 230101101230102. Its totient is φ = 230101101230100.
The previous prime is 230101101230089. The next prime is 230101101230107. The reversal of 230101101230101 is 101032101101032.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 223390359170001 + 6710742060100 = 14946249^2 + 2590510^2 .
It is a cyclic number.
It is not a de Polignac number, because 230101101230101 - 213 = 230101101221909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230101101230107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115050550615050 + 115050550615051.
It is an arithmetic number, because the mean of its divisors is an integer number (115050550615051).
Almost surely, 2230101101230101 is an apocalyptic number.
It is an amenable number.
230101101230101 is a deficient number, since it is larger than the sum of its proper divisors (1).
230101101230101 is an equidigital number, since it uses as much as digits as its factorization.
230101101230101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 230101101230101 its reverse (101032101101032), we get a palindrome (331133202331133).
The spelling of 230101101230101 in words is "two hundred thirty trillion, one hundred one billion, one hundred one million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •