Base | Representation |
---|---|
bin | 100100000110110… |
… | …1000101011001111 |
3 | 10010102201022020210 |
4 | 1020031220223033 |
5 | 4440123042111 |
6 | 320115213503 |
7 | 42010604121 |
oct | 11015505317 |
9 | 3112638223 |
10 | 1211534031 |
11 | 5719744a4 |
12 | 2998a7293 |
13 | 164002356 |
14 | b6c93211 |
15 | 715680a6 |
hex | 48368acf |
1211534031 has 32 divisors (see below), whose sum is σ = 1751964160. Its totient is φ = 742110336.
The previous prime is 1211534021. The next prime is 1211534041. The reversal of 1211534031 is 1304351121.
It is an interprime number because it is at equal distance from previous prime (1211534021) and next prime (1211534041).
It is not a de Polignac number, because 1211534031 - 211 = 1211531983 is a prime.
It is a super-2 number, since 2×12115340312 = 2935629416542217922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211533989 and 1211534007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211534011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 836550 + ... + 837996.
It is an arithmetic number, because the mean of its divisors is an integer number (54748880).
Almost surely, 21211534031 is an apocalyptic number.
1211534031 is a deficient number, since it is larger than the sum of its proper divisors (540430129).
1211534031 is a wasteful number, since it uses less digits than its factorization.
1211534031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1903.
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 1211534031 is about 34807.0974227958. The cubic root of 1211534031 is about 1066.0523680459.
Adding to 1211534031 its reverse (1304351121), we get a palindrome (2515885152).
The spelling of 1211534031 in words is "one billion, two hundred eleven million, five hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •