Base | Representation |
---|---|
bin | 100001011100101… |
… | …0110100110010111 |
3 | 2220012212022201222 |
4 | 1002321112212113 |
5 | 4244304043111 |
6 | 303211240555 |
7 | 36545441063 |
oct | 10271264627 |
9 | 2805768658 |
10 | 1122331031 |
11 | 526587a08 |
12 | 273a4915b |
13 | 14b69c103 |
14 | a90b2aa3 |
15 | 687e77db |
hex | 42e56997 |
1122331031 has 4 divisors (see below), whose sum is σ = 1133901552. Its totient is φ = 1110760512.
The previous prime is 1122331019. The next prime is 1122331033. The reversal of 1122331031 is 1301332211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1301332211 = 19 ⋅68491169.
It is a cyclic number.
It is not a de Polignac number, because 1122331031 - 26 = 1122330967 is a prime.
It is a super-2 number, since 2×11223310312 = 2519253886291045922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122331033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5785115 + ... + 5785308.
It is an arithmetic number, because the mean of its divisors is an integer number (283475388).
Almost surely, 21122331031 is an apocalyptic number.
1122331031 is a deficient number, since it is larger than the sum of its proper divisors (11570521).
1122331031 is an equidigital number, since it uses as much as digits as its factorization.
1122331031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11570520.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1122331031 is about 33501.2093960800. The cubic root of 1122331031 is about 1039.2187892540.
Adding to 1122331031 its reverse (1301332211), we get a palindrome (2423663242).
The spelling of 1122331031 in words is "one billion, one hundred twenty-two million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •