Base | Representation |
---|---|
bin | 1101011010100011011… |
… | …0111101000010011001 |
3 | 211000212120220021110000 |
4 | 3112220312331002121 |
5 | 12233443324313021 |
6 | 253512535243213 |
7 | 22436111521014 |
oct | 3265066750231 |
9 | 730776807400 |
10 | 230466244761 |
11 | 89816206885 |
12 | 387ba819509 |
13 | 1896b17b03c |
14 | b22441637b |
15 | 5edce99b26 |
hex | 35a8dbd099 |
230466244761 has 45 divisors (see below), whose sum is σ = 353149979149. Its totient is φ = 149781528000.
The previous prime is 230466244739. The next prime is 230466244777. The reversal of 230466244761 is 167442664032.
The square root of 230466244761 is 480069.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 215174449161 + 15291795600 = 463869^2 + 123660^2 .
It is not a de Polignac number, because 230466244761 - 213 = 230466236569 is a prime.
It is a super-2 number, since 2×2304662447612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230466244711) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 177144811 + ... + 177146111.
Almost surely, 2230466244761 is an apocalyptic number.
230466244761 is the 480069-th square number.
230466244761 is the 240035-th centered octagonal number.
It is an amenable number.
230466244761 is a deficient number, since it is larger than the sum of its proper divisors (122683734388).
230466244761 is an frugal number, since it uses more digits than its factorization.
230466244761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2696 (or 1345 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 45.
The spelling of 230466244761 in words is "two hundred thirty billion, four hundred sixty-six million, two hundred forty-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •