Base | Representation |
---|---|
bin | 111101011101000… |
… | …010001011111111 |
3 | 2122212001022100111 |
4 | 331131002023333 |
5 | 4102420140221 |
6 | 250150210451 |
7 | 34356352015 |
oct | 7535021377 |
9 | 2585038314 |
10 | 1031021311 |
11 | 489a91631 |
12 | 249353a27 |
13 | 1357abca8 |
14 | 9ad048b5 |
15 | 607acbe1 |
hex | 3d7422ff |
1031021311 has 8 divisors (see below), whose sum is σ = 1074363120. Its totient is φ = 988198848.
The previous prime is 1031021297. The next prime is 1031021333. The reversal of 1031021311 is 1131201301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1031021311 - 27 = 1031021183 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031021291 and 1031021300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031021911) 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 7 ways as a sum of consecutive naturals, for example, 125781 + ... + 133726.
It is an arithmetic number, because the mean of its divisors is an integer number (134295390).
Almost surely, 21031021311 is an apocalyptic number.
1031021311 is a deficient number, since it is larger than the sum of its proper divisors (43341809).
1031021311 is a wasteful number, since it uses less digits than its factorization.
1031021311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259673.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1031021311 is about 32109.5205663367. The cubic root of 1031021311 is about 1010.2353178454.
Adding to 1031021311 its reverse (1131201301), we get a palindrome (2162222612).
The spelling of 1031021311 in words is "one billion, thirty-one million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •