Base | Representation |
---|---|
bin | 110100010110010100011110… |
… | …010110011110010111100001 |
3 | 1010012011222122001010112121221 |
4 | 310112110132112132113201 |
5 | 220134111102131010423 |
6 | 2133355120555215041 |
7 | 66331505212620061 |
oct | 6426243626362741 |
9 | 1105158561115557 |
10 | 230232231110113 |
11 | 673a4a39357691 |
12 | 219a4670447481 |
13 | 9b60a633b708b |
14 | 40bd4299553a1 |
15 | 1b93d06c2ae5d |
hex | d1651e59e5e1 |
230232231110113 has 2 divisors, whose sum is σ = 230232231110114. Its totient is φ = 230232231110112.
The previous prime is 230232231110111. The next prime is 230232231110149. The reversal of 230232231110113 is 311011132232032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 230231066116689 + 1164993424 = 15173367^2 + 34132^2 .
It is a cyclic number.
It is not a de Polignac number, because 230232231110113 - 21 = 230232231110111 is a prime.
Together with 230232231110111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (230232231110111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115116115555056 + 115116115555057.
It is an arithmetic number, because the mean of its divisors is an integer number (115116115555057).
Almost surely, 2230232231110113 is an apocalyptic number.
It is an amenable number.
230232231110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
230232231110113 is an equidigital number, since it uses as much as digits as its factorization.
230232231110113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 230232231110113 its reverse (311011132232032), we get a palindrome (541243363342145).
The spelling of 230232231110113 in words is "two hundred thirty trillion, two hundred thirty-two billion, two hundred thirty-one million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •