Base | Representation |
---|---|
bin | 100100000110011… |
… | …0100111101110111 |
3 | 10010102022112201100 |
4 | 1020030310331313 |
5 | 4440044302411 |
6 | 320110501143 |
7 | 42006032460 |
oct | 11014647567 |
9 | 3112275640 |
10 | 1211322231 |
11 | 57183a359 |
12 | 2998047b3 |
13 | 163c59b22 |
14 | b6c39d67 |
15 | 71525456 |
hex | 48334f77 |
1211322231 has 12 divisors (see below), whose sum is σ = 1999643152. Its totient is φ = 692184096.
The previous prime is 1211322197. The next prime is 1211322239. The reversal of 1211322231 is 1322231121.
It is not a de Polignac number, because 1211322231 - 27 = 1211322103 is a prime.
It is a super-2 number, since 2×12113222312 = 2934603094629634722, 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 (1211322239) 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 11 ways as a sum of consecutive naturals, for example, 9613606 + ... + 9613731.
Almost surely, 21211322231 is an apocalyptic number.
1211322231 is a deficient number, since it is larger than the sum of its proper divisors (788320921).
1211322231 is a wasteful number, since it uses less digits than its factorization.
1211322231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19227350 (or 19227347 counting only the distinct ones).
The product of its digits is 144, while the sum is 18.
The square root of 1211322231 is about 34804.0548068756. The cubic root of 1211322231 is about 1065.9902421118.
Adding to 1211322231 its reverse (1322231121), we get a palindrome (2533553352).
It can be divided in two parts, 121 and 1322231, that multiplied together give a palindrome (159989951).
The spelling of 1211322231 in words is "one billion, two hundred eleven million, three hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •