Base | Representation |
---|---|
bin | 1101011001101011001… |
… | …1000000101010011011 |
3 | 211000021010222120020200 |
4 | 3112122303000222123 |
5 | 12233002431030021 |
6 | 253433310553243 |
7 | 22430215341633 |
oct | 3263263005233 |
9 | 730233876220 |
10 | 230230330011 |
11 | 89705023610 |
12 | 38753808823 |
13 | 1893132a806 |
14 | b200d656c3 |
15 | 5ec73e9126 |
hex | 359acc0a9b |
230230330011 has 48 divisors (see below), whose sum is σ = 365490797568. Its totient is φ = 138495614400.
The previous prime is 230230330007. The next prime is 230230330079. The reversal of 230230330011 is 110033032032.
230230330011 is a `hidden beast` number, since 2 + 302 + 30 + 330 + 0 + 1 + 1 = 666.
230230330011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230230330011 - 22 = 230230330007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (230230330111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15395640 + ... + 15410586.
It is an arithmetic number, because the mean of its divisors is an integer number (7614391616).
Almost surely, 2230230330011 is an apocalyptic number.
230230330011 is a deficient number, since it is larger than the sum of its proper divisors (135260467557).
230230330011 is a wasteful number, since it uses less digits than its factorization.
230230330011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16112 (or 16109 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 230230330011 its reverse (110033032032), we get a palindrome (340263362043).
The spelling of 230230330011 in words is "two hundred thirty billion, two hundred thirty million, three hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •