Base | Representation |
---|---|
bin | 111100010001111… |
… | …000100011000111 |
3 | 2121110222102122111 |
4 | 330101320203013 |
5 | 4032344233111 |
6 | 244204041451 |
7 | 34030041550 |
oct | 7421704307 |
9 | 2543872574 |
10 | 1011321031 |
11 | 479956506 |
12 | 242833287 |
13 | 1316a2116 |
14 | 98457327 |
15 | 5dbbaa21 |
hex | 3c4788c7 |
1011321031 has 8 divisors (see below), whose sum is σ = 1195650720. Its totient is φ = 836955168.
The previous prime is 1011321023. The next prime is 1011321061. The reversal of 1011321031 is 1301231101.
1011321031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1011321031 - 23 = 1011321023 is a prime.
It is a super-2 number, since 2×10113210312 = 2045540455485805922, 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 (1011321061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2490736 + ... + 2491141.
It is an arithmetic number, because the mean of its divisors is an integer number (149456340).
Almost surely, 21011321031 is an apocalyptic number.
1011321031 is a deficient number, since it is larger than the sum of its proper divisors (184329689).
1011321031 is an equidigital number, since it uses as much as digits as its factorization.
1011321031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4981913.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1011321031 is about 31801.2740468051. The cubic root of 1011321031 is about 1003.7595252574.
Adding to 1011321031 its reverse (1301231101), we get a palindrome (2312552132).
The spelling of 1011321031 in words is "one billion, eleven million, three hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •