Base | Representation |
---|---|
bin | 110011110010011010… |
… | …0000010101101010111 |
3 | 101122001121221022000200 |
4 | 1213210310002231113 |
5 | 3310231013431411 |
6 | 123031321111543 |
7 | 11014651105512 |
oct | 1474464025527 |
9 | 348047838020 |
10 | 111213030231 |
11 | 4318a946736 |
12 | 196790285b3 |
13 | a644904284 |
14 | 5550345d79 |
15 | 2d5d858e56 |
hex | 19e4d02b57 |
111213030231 has 6 divisors (see below), whose sum is σ = 160641043680. Its totient is φ = 74142020148.
The previous prime is 111213030143. The next prime is 111213030259. The reversal of 111213030231 is 132030312111.
111213030231 is a `hidden beast` number, since 11 + 121 + 303 + 0 + 231 = 666.
It is not a de Polignac number, because 111213030231 - 211 = 111213028183 is a prime.
It is a super-2 number, since 2×1112130302312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111213030281) 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 5 ways as a sum of consecutive naturals, for example, 6178501671 + ... + 6178501688.
It is an arithmetic number, because the mean of its divisors is an integer number (26773507280).
Almost surely, 2111213030231 is an apocalyptic number.
111213030231 is a deficient number, since it is larger than the sum of its proper divisors (49428013449).
111213030231 is a wasteful number, since it uses less digits than its factorization.
111213030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12357003365 (or 12357003362 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 111213030231 its reverse (132030312111), we get a palindrome (243243342342).
The spelling of 111213030231 in words is "one hundred eleven billion, two hundred thirteen million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •