Base | Representation |
---|---|
bin | 111100010101011… |
… | …001101010100111 |
3 | 2121112201021111121 |
4 | 330111121222213 |
5 | 4033113234421 |
6 | 244235514411 |
7 | 34040632045 |
oct | 7425315247 |
9 | 2545637447 |
10 | 1012243111 |
11 | 47a426260 |
12 | 242bb8a07 |
13 | 131935a29 |
14 | 98617395 |
15 | 5dcedd41 |
hex | 3c559aa7 |
1012243111 has 16 divisors (see below), whose sum is σ = 1111968000. Its totient is φ = 913830400.
The previous prime is 1012243049. The next prime is 1012243123. The reversal of 1012243111 is 1113422101.
It is a cyclic number.
It is not a de Polignac number, because 1012243111 - 27 = 1012242983 is a prime.
It is a super-2 number, since 2×10122431112 = 2049272231533916642, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012243181) 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 15 ways as a sum of consecutive naturals, for example, 1535700 + ... + 1536358.
It is an arithmetic number, because the mean of its divisors is an integer number (69498000).
Almost surely, 21012243111 is an apocalyptic number.
1012243111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1012243111 is a deficient number, since it is larger than the sum of its proper divisors (99724889).
1012243111 is a wasteful number, since it uses less digits than its factorization.
1012243111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1430.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1012243111 is about 31815.7682761237. The cubic root of 1012243111 is about 1004.0644945025.
Adding to 1012243111 its reverse (1113422101), we get a palindrome (2125665212).
The spelling of 1012243111 in words is "one billion, twelve million, two hundred forty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •