Base | Representation |
---|---|
bin | 1101011010011101001… |
… | …1011000001001111001 |
3 | 211000210202210002102002 |
4 | 3112213103120021321 |
5 | 12233420134011213 |
6 | 253510203550345 |
7 | 22435343612015 |
oct | 3264723301171 |
9 | 730722702362 |
10 | 230440141433 |
11 | 898024a7a87 |
12 | 387b1b2b3b5 |
13 | 1896593b898 |
14 | b220b7d545 |
15 | 5edaa40658 |
hex | 35a74d8279 |
230440141433 has 2 divisors, whose sum is σ = 230440141434. Its totient is φ = 230440141432.
The previous prime is 230440141411. The next prime is 230440141439. The reversal of 230440141433 is 334141044032.
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., 230042059129 + 398082304 = 479627^2 + 19952^2 .
It is a cyclic number.
It is not a de Polignac number, because 230440141433 - 236 = 161720664697 is a prime.
It is a super-2 number, since 2×2304401414332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230440141396 and 230440141405.
It is not a weakly prime, because it can be changed into another prime (230440141439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115220070716 + 115220070717.
It is an arithmetic number, because the mean of its divisors is an integer number (115220070717).
Almost surely, 2230440141433 is an apocalyptic number.
It is an amenable number.
230440141433 is a deficient number, since it is larger than the sum of its proper divisors (1).
230440141433 is an equidigital number, since it uses as much as digits as its factorization.
230440141433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 230440141433 its reverse (334141044032), we get a palindrome (564581185465).
The spelling of 230440141433 in words is "two hundred thirty billion, four hundred forty million, one hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •