Base | Representation |
---|---|
bin | 100001001011010… |
… | …0100010011100011 |
3 | 2212120201000221221 |
4 | 1002112210103203 |
5 | 4234440242011 |
6 | 302243555511 |
7 | 36405101263 |
oct | 10226442343 |
9 | 2776630857 |
10 | 1113212131 |
11 | 521419829 |
12 | 27098bb97 |
13 | 149828605 |
14 | a7bbb7a3 |
15 | 67ae5971 |
hex | 425a44e3 |
1113212131 has 4 divisors (see below), whose sum is σ = 1118863152. Its totient is φ = 1107561112.
The previous prime is 1113212117. The next prime is 1113212137. The reversal of 1113212131 is 1312123111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1113212131 - 217 = 1113081059 is a prime.
It is a super-2 number, since 2×11132121312 = 2478482497211122322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113212137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2825215 + ... + 2825608.
It is an arithmetic number, because the mean of its divisors is an integer number (279715788).
Almost surely, 21113212131 is an apocalyptic number.
1113212131 is a deficient number, since it is larger than the sum of its proper divisors (5651021).
1113212131 is an equidigital number, since it uses as much as digits as its factorization.
1113212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5651020.
The product of its digits is 36, while the sum is 16.
The square root of 1113212131 is about 33364.8337475253. The cubic root of 1113212131 is about 1036.3965933262.
Adding to 1113212131 its reverse (1312123111), we get a palindrome (2425335242).
The spelling of 1113212131 in words is "one billion, one hundred thirteen million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •