Base | Representation |
---|---|
bin | 11011011101111… |
… | …01001111110101 |
3 | 121001120012121222 |
4 | 31232331033311 |
5 | 432441211201 |
6 | 34510320125 |
7 | 5465323616 |
oct | 1556751765 |
9 | 531505558 |
10 | 230413301 |
11 | 109075a18 |
12 | 651b9045 |
13 | 38975441 |
14 | 2285bc0d |
15 | 1536591b |
hex | dbbd3f5 |
230413301 has 2 divisors, whose sum is σ = 230413302. Its totient is φ = 230413300.
The previous prime is 230413279. The next prime is 230413321. The reversal of 230413301 is 103314032.
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., 221116900 + 9296401 = 14870^2 + 3049^2 .
It is a cyclic number.
It is not a de Polignac number, because 230413301 - 226 = 163304437 is a prime.
It is a super-3 number, since 3×2304133013 (a number of 26 digits) contains 333 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230413301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230413321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115206650 + 115206651.
It is an arithmetic number, because the mean of its divisors is an integer number (115206651).
Almost surely, 2230413301 is an apocalyptic number.
It is an amenable number.
230413301 is a deficient number, since it is larger than the sum of its proper divisors (1).
230413301 is an equidigital number, since it uses as much as digits as its factorization.
230413301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 230413301 is about 15179.3709026428. The cubic root of 230413301 is about 613.0593427732.
Adding to 230413301 its reverse (103314032), we get a palindrome (333727333).
The spelling of 230413301 in words is "two hundred thirty million, four hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •