Base | Representation |
---|---|
bin | 11011011110101… |
… | …01110101111001 |
3 | 121001202022211002 |
4 | 31233111311321 |
5 | 433002422131 |
6 | 34512414345 |
7 | 5466223412 |
oct | 1557256571 |
9 | 531668732 |
10 | 230514041 |
11 | 10913467a |
12 | 652473b5 |
13 | 389ac254 |
14 | 22886809 |
15 | 153856cb |
hex | dbd5d79 |
230514041 has 2 divisors, whose sum is σ = 230514042. Its totient is φ = 230514040.
The previous prime is 230514029. The next prime is 230514043. The reversal of 230514041 is 140415032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182142016 + 48372025 = 13496^2 + 6955^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230514041 is a prime.
Together with 230514043, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (230514043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115257020 + 115257021.
It is an arithmetic number, because the mean of its divisors is an integer number (115257021).
Almost surely, 2230514041 is an apocalyptic number.
It is an amenable number.
230514041 is a deficient number, since it is larger than the sum of its proper divisors (1).
230514041 is an equidigital number, since it uses as much as digits as its factorization.
230514041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 230514041 is about 15182.6888593556. The cubic root of 230514041 is about 613.1486758678.
Adding to 230514041 its reverse (140415032), we get a palindrome (370929073).
Subtracting from 230514041 its reverse (140415032), we obtain a palindrome (90099009).
The spelling of 230514041 in words is "two hundred thirty million, five hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •