Base | Representation |
---|---|
bin | 1101011010110110001… |
… | …0011110000111100101 |
3 | 211001002001122022220121 |
4 | 3112231202132013211 |
5 | 12234123424330232 |
6 | 253524422201541 |
7 | 22441054065163 |
oct | 3265542360745 |
9 | 731061568817 |
10 | 230544761317 |
11 | 898565644a2 |
12 | 38820b832b1 |
13 | 1898150c140 |
14 | b230a14233 |
15 | 5ee4d08d97 |
hex | 35ad89e1e5 |
230544761317 has 4 divisors (see below), whose sum is σ = 248278973740. Its totient is φ = 212810548896.
The previous prime is 230544761297. The next prime is 230544761323. The reversal of 230544761317 is 713167445032.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 20222546436 + 210322214881 = 142206^2 + 458609^2 .
It is a cyclic number.
It is not a de Polignac number, because 230544761317 - 27 = 230544761189 is a prime.
It is a super-4 number, since 4×2305447613174 (a number of 47 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230544761327) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8867106192 + ... + 8867106217.
It is an arithmetic number, because the mean of its divisors is an integer number (62069743435).
Almost surely, 2230544761317 is an apocalyptic number.
It is an amenable number.
230544761317 is a deficient number, since it is larger than the sum of its proper divisors (17734212423).
230544761317 is a wasteful number, since it uses less digits than its factorization.
230544761317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17734212422.
The product of its (nonzero) digits is 423360, while the sum is 43.
The spelling of 230544761317 in words is "two hundred thirty billion, five hundred forty-four million, seven hundred sixty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •