Base | Representation |
---|---|
bin | 111101011101011… |
… | …010110011010101 |
3 | 2122212020102122122 |
4 | 331131122303111 |
5 | 4102431402013 |
6 | 250152305325 |
7 | 34360251656 |
oct | 7535326325 |
9 | 2585212578 |
10 | 1031122133 |
11 | 48a050358 |
12 | 2493a2245 |
13 | 135815b52 |
14 | 9ad2d52d |
15 | 607cca08 |
hex | 3d75acd5 |
1031122133 has 4 divisors (see below), whose sum is σ = 1031522688. Its totient is φ = 1030721580.
The previous prime is 1031122121. The next prime is 1031122139. The reversal of 1031122133 is 3312211301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1031122133 - 24 = 1031122117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031122139) 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 3 ways as a sum of consecutive naturals, for example, 196391 + ... + 201572.
It is an arithmetic number, because the mean of its divisors is an integer number (257880672).
Almost surely, 21031122133 is an apocalyptic number.
It is an amenable number.
1031122133 is a deficient number, since it is larger than the sum of its proper divisors (400555).
1031122133 is an equidigital number, since it uses as much as digits as its factorization.
1031122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400554.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1031122133 is about 32111.0904984555. The cubic root of 1031122133 is about 1010.2682465619.
Adding to 1031122133 its reverse (3312211301), we get a palindrome (4343333434).
The spelling of 1031122133 in words is "one billion, thirty-one million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •