Base | Representation |
---|---|
bin | 110100010100101110000000… |
… | …110001000111100111001101 |
3 | 1010011210110122200212011212001 |
4 | 310110232000301013213031 |
5 | 220130310243024043034 |
6 | 2133232404003512301 |
7 | 66320531652226552 |
oct | 6424560061074715 |
9 | 1104713580764761 |
10 | 230122213112269 |
11 | 67362312034525 |
12 | 21987287688691 |
13 | 9b5357c25817a |
14 | 40b7d90208a29 |
15 | 1b9101827aa14 |
hex | d14b80c479cd |
230122213112269 has 2 divisors, whose sum is σ = 230122213112270. Its totient is φ = 230122213112268.
The previous prime is 230122213112243. The next prime is 230122213112279. The reversal of 230122213112269 is 962211312221032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126765914167369 + 103356298944900 = 11259037^2 + 10166430^2 .
It is a cyclic number.
It is not a de Polignac number, because 230122213112269 - 211 = 230122213110221 is a prime.
It is a super-2 number, since 2×2301222131122692 (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 (230122213112279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115061106556134 + 115061106556135.
It is an arithmetic number, because the mean of its divisors is an integer number (115061106556135).
Almost surely, 2230122213112269 is an apocalyptic number.
It is an amenable number.
230122213112269 is a deficient number, since it is larger than the sum of its proper divisors (1).
230122213112269 is an equidigital number, since it uses as much as digits as its factorization.
230122213112269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 230122213112269 in words is "two hundred thirty trillion, one hundred twenty-two billion, two hundred thirteen million, one hundred twelve thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •