Base | Representation |
---|---|
bin | 11011010101100… |
… | …00000011011001 |
3 | 120222111012010012 |
4 | 31222300003121 |
5 | 432200420211 |
6 | 34430531305 |
7 | 5453052155 |
oct | 1552600331 |
9 | 528435105 |
10 | 229310681 |
11 | 108492566 |
12 | 64966b35 |
13 | 3867a5c2 |
14 | 22652065 |
15 | 151e8d8b |
hex | dab00d9 |
229310681 has 2 divisors, whose sum is σ = 229310682. Its totient is φ = 229310680.
The previous prime is 229310659. The next prime is 229310707. The reversal of 229310681 is 186013922.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 155625625 + 73685056 = 12475^2 + 8584^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-229310681 is a prime.
It is a super-2 number, since 2×2293106812 = 105166776841367522, which contains 22 as substring.
It is a Chen prime.
It is equal to p12606683 and since 229310681 and 12606683 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (229310881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 114655340 + 114655341.
It is an arithmetic number, because the mean of its divisors is an integer number (114655341).
Almost surely, 2229310681 is an apocalyptic number.
It is an amenable number.
229310681 is a deficient number, since it is larger than the sum of its proper divisors (1).
229310681 is an equidigital number, since it uses as much as digits as its factorization.
229310681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 229310681 is about 15143.0076603032. The cubic root of 229310681 is about 612.0798671523.
The spelling of 229310681 in words is "two hundred twenty-nine million, three hundred ten thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •