Base | Representation |
---|---|
bin | 11011011110001… |
… | …11101101000011 |
3 | 121001122101101021 |
4 | 31233013231003 |
5 | 432444044011 |
6 | 34511250311 |
7 | 5465562523 |
oct | 1557075503 |
9 | 531571337 |
10 | 230456131 |
11 | 1090a5114 |
12 | 65219997 |
13 | 3898ba99 |
14 | 2286d683 |
15 | 15373471 |
hex | dbc7b43 |
230456131 has 16 divisors (see below), whose sum is σ = 248583168. Its totient is φ = 212867200.
The previous prime is 230456119. The next prime is 230456143. The reversal of 230456131 is 131654032.
It is an interprime number because it is at equal distance from previous prime (230456119) and next prime (230456143).
It is not a de Polignac number, because 230456131 - 27 = 230456003 is a prime.
It is a super-2 number, since 2×2304561312 = 106220056630978322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230456096 and 230456105.
It is not an unprimeable number, because it can be changed into a prime (230451131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 519996 + ... + 520438.
It is an arithmetic number, because the mean of its divisors is an integer number (15536448).
Almost surely, 2230456131 is an apocalyptic number.
230456131 is a deficient number, since it is larger than the sum of its proper divisors (18127037).
230456131 is a wasteful number, since it uses less digits than its factorization.
230456131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 230456131 is about 15180.7816333679. The cubic root of 230456131 is about 613.0973262646.
The spelling of 230456131 in words is "two hundred thirty million, four hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •