Base | Representation |
---|---|
bin | 1101011001010000111… |
… | …0001110000001011111 |
3 | 210222222110102100020220 |
4 | 3112110032032001133 |
5 | 12232241211201421 |
6 | 253414330412423 |
7 | 22424405625360 |
oct | 3262416160137 |
9 | 728873370226 |
10 | 230120022111 |
11 | 89658831661 |
12 | 38722891113 |
13 | 18914518275 |
14 | b1d044db67 |
15 | 5ebc8aa3c6 |
hex | 359438e05f |
230120022111 has 16 divisors (see below), whose sum is σ = 351614567424. Its totient is φ = 131138848224.
The previous prime is 230120022091. The next prime is 230120022173. The reversal of 230120022111 is 111220021032.
230120022111 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 230120022111 - 26 = 230120022047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230120024111) 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 15 ways as a sum of consecutive naturals, for example, 14921580 + ... + 14936993.
It is an arithmetic number, because the mean of its divisors is an integer number (21975910464).
Almost surely, 2230120022111 is an apocalyptic number.
230120022111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
230120022111 is a deficient number, since it is larger than the sum of its proper divisors (121494545313).
230120022111 is a wasteful number, since it uses less digits than its factorization.
230120022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29858950.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 230120022111 its reverse (111220021032), we get a palindrome (341340043143).
The spelling of 230120022111 in words is "two hundred thirty billion, one hundred twenty million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •