Base | Representation |
---|---|
bin | 1101011001111111001… |
… | …0010110101110001101 |
3 | 211000110222111200122221 |
4 | 3112133302112232031 |
5 | 12233140343404201 |
6 | 253445501135341 |
7 | 22432253034625 |
oct | 3263762265615 |
9 | 730428450587 |
10 | 230314044301 |
11 | 89748301380 |
12 | 3877785a551 |
13 | 1894578b6b3 |
14 | b20c117885 |
15 | 5ece9334a1 |
hex | 359fc96b8d |
230314044301 has 4 divisors (see below), whose sum is σ = 251251684704. Its totient is φ = 209376403900.
The previous prime is 230314044299. The next prime is 230314044319. The reversal of 230314044301 is 103440413032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 230314044301 - 21 = 230314044299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230314041301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10468820185 + ... + 10468820206.
It is an arithmetic number, because the mean of its divisors is an integer number (62812921176).
Almost surely, 2230314044301 is an apocalyptic number.
It is an amenable number.
230314044301 is a deficient number, since it is larger than the sum of its proper divisors (20937640403).
230314044301 is a wasteful number, since it uses less digits than its factorization.
230314044301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20937640402.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 230314044301 its reverse (103440413032), we get a palindrome (333754457333).
The spelling of 230314044301 in words is "two hundred thirty billion, three hundred fourteen million, forty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •