Base | Representation |
---|---|
bin | 1101011001010000111… |
… | …0001110100000101111 |
3 | 210222222110102102222222 |
4 | 3112110032032200233 |
5 | 12232241211232421 |
6 | 253414330425555 |
7 | 22424405634245 |
oct | 3262416164057 |
9 | 728873372888 |
10 | 230120024111 |
11 | 8965883310a |
12 | 387228922bb |
13 | 18914519153 |
14 | b1d0450795 |
15 | 5ebc8aacab |
hex | 359438e82f |
230120024111 has 2 divisors, whose sum is σ = 230120024112. Its totient is φ = 230120024110.
The previous prime is 230120024089. The next prime is 230120024149. The reversal of 230120024111 is 111420021032.
230120024111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 230120024111 - 210 = 230120023087 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230120024111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230120024191) 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 as a sum of consecutive naturals, namely, 115060012055 + 115060012056.
It is an arithmetic number, because the mean of its divisors is an integer number (115060012056).
Almost surely, 2230120024111 is an apocalyptic number.
230120024111 is a deficient number, since it is larger than the sum of its proper divisors (1).
230120024111 is an equidigital number, since it uses as much as digits as its factorization.
230120024111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 230120024111 its reverse (111420021032), we get a palindrome (341540045143).
The spelling of 230120024111 in words is "two hundred thirty billion, one hundred twenty million, twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •