Base | Representation |
---|---|
bin | 100100000101110… |
… | …1110001001000101 |
3 | 10010101202210202222 |
4 | 1020023232021011 |
5 | 4440011012013 |
6 | 320100342125 |
7 | 42003413633 |
oct | 11013561105 |
9 | 3111683688 |
10 | 1211032133 |
11 | 571661403 |
12 | 2996a4945 |
13 | 163b87a7c |
14 | b6ba2353 |
15 | 714b9508 |
hex | 482ee245 |
1211032133 has 4 divisors (see below), whose sum is σ = 1263685728. Its totient is φ = 1158378540.
The previous prime is 1211032103. The next prime is 1211032157. The reversal of 1211032133 is 3312301121.
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 1211032133 - 226 = 1143923269 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 (1211032103) 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, 26326763 + ... + 26326808.
It is an arithmetic number, because the mean of its divisors is an integer number (315921432).
Almost surely, 21211032133 is an apocalyptic number.
It is an amenable number.
1211032133 is a deficient number, since it is larger than the sum of its proper divisors (52653595).
1211032133 is an equidigital number, since it uses as much as digits as its factorization.
1211032133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52653594.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1211032133 is about 34799.8869682072. The cubic root of 1211032133 is about 1065.9051377745.
Adding to 1211032133 its reverse (3312301121), we get a palindrome (4523333254).
The spelling of 1211032133 in words is "one billion, two hundred eleven million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •