Base | Representation |
---|---|
bin | 1101011100010000011… |
… | …1101100001010000101 |
3 | 211002001110112012001220 |
4 | 3113010013230022011 |
5 | 12240412421220101 |
6 | 254030154310553 |
7 | 22453334233335 |
oct | 3270407541205 |
9 | 732043465056 |
10 | 230923616901 |
11 | 89a303a828a |
12 | 38907a28459 |
13 | 18a11b59443 |
14 | b2690730c5 |
15 | 60181e2636 |
hex | 35c41ec285 |
230923616901 has 4 divisors (see below), whose sum is σ = 307898155872. Its totient is φ = 153949077932.
The previous prime is 230923616879. The next prime is 230923616921. The reversal of 230923616901 is 109616329032.
It is a happy number.
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 230923616901 - 26 = 230923616837 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230923616921) 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 3 ways as a sum of consecutive naturals, for example, 38487269481 + ... + 38487269486.
It is an arithmetic number, because the mean of its divisors is an integer number (76974538968).
Almost surely, 2230923616901 is an apocalyptic number.
It is an amenable number.
230923616901 is a deficient number, since it is larger than the sum of its proper divisors (76974538971).
230923616901 is an equidigital number, since it uses as much as digits as its factorization.
230923616901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76974538970.
The product of its (nonzero) digits is 104976, while the sum is 42.
The spelling of 230923616901 in words is "two hundred thirty billion, nine hundred twenty-three million, six hundred sixteen thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •