Base | Representation |
---|---|
bin | 1101011100001001001… |
… | …1010001111110111111 |
3 | 211001222100002211010000 |
4 | 3113002103101332333 |
5 | 12240332113212431 |
6 | 254023144245343 |
7 | 22452513655560 |
oct | 3270223217677 |
9 | 731870084100 |
10 | 230893100991 |
11 | 89a15155223 |
12 | 388b9770853 |
13 | 18a087336a7 |
14 | b264dac167 |
15 | 60156b59e6 |
hex | 35c24d1fbf |
230893100991 has 40 divisors (see below), whose sum is σ = 394396421760. Its totient is φ = 131869110672.
The previous prime is 230893100969. The next prime is 230893101013. The reversal of 230893100991 is 199001398032.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (230893100969) and next prime (230893101013).
It is not a de Polignac number, because 230893100991 - 27 = 230893100863 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230893100941) 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 39 ways as a sum of consecutive naturals, for example, 974500 + ... + 1188038.
It is an arithmetic number, because the mean of its divisors is an integer number (9859910544).
Almost surely, 2230893100991 is an apocalyptic number.
230893100991 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
230893100991 is a deficient number, since it is larger than the sum of its proper divisors (163503320769).
230893100991 is a wasteful number, since it uses less digits than its factorization.
230893100991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215465 (or 215456 counting only the distinct ones).
The product of its (nonzero) digits is 104976, while the sum is 45.
The spelling of 230893100991 in words is "two hundred thirty billion, eight hundred ninety-three million, one hundred thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •