Base | Representation |
---|---|
bin | 1101011010000011000… |
… | …0011010000110110011 |
3 | 211000112010010010111122 |
4 | 3112200300122012303 |
5 | 12233204024423331 |
6 | 253451241532455 |
7 | 22432541224646 |
oct | 3264060320663 |
9 | 730463103448 |
10 | 230330311091 |
11 | 89756501901 |
12 | 387811a412b |
13 | 18948c6580a |
14 | b21034da5d |
15 | 5ed109817b |
hex | 35a0c1a1b3 |
230330311091 has 4 divisors (see below), whose sum is σ = 236555454672. Its totient is φ = 224105167512.
The previous prime is 230330311067. The next prime is 230330311103. The reversal of 230330311091 is 190113033032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230330311091 is a prime.
It is a super-2 number, since 2×2303303110912 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230330311091.
It is not an unprimeable number, because it can be changed into a prime (230330311061) 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, 3112571735 + ... + 3112571808.
It is an arithmetic number, because the mean of its divisors is an integer number (59138863668).
Almost surely, 2230330311091 is an apocalyptic number.
230330311091 is a deficient number, since it is larger than the sum of its proper divisors (6225143581).
230330311091 is an equidigital number, since it uses as much as digits as its factorization.
230330311091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6225143580.
The product of its (nonzero) digits is 1458, while the sum is 26.
The spelling of 230330311091 in words is "two hundred thirty billion, three hundred thirty million, three hundred eleven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •