Base | Representation |
---|---|
bin | 111100110100010… |
… | …000011111111111 |
3 | 2122002221020102020 |
4 | 330310100133333 |
5 | 4042201111111 |
6 | 245125131223 |
7 | 34166451645 |
oct | 7464203777 |
9 | 2562836366 |
10 | 1020332031 |
11 | 483a50614 |
12 | 245859b13 |
13 | 133508784 |
14 | 99721195 |
15 | 5e89a906 |
hex | 3cd107ff |
1020332031 has 16 divisors (see below), whose sum is σ = 1389056256. Its totient is φ = 666060416.
The previous prime is 1020332009. The next prime is 1020332057. The reversal of 1020332031 is 1302330201.
It is a cyclic number.
It is not a de Polignac number, because 1020332031 - 27 = 1020331903 is a prime.
It is a super-2 number, since 2×10203320312 = 2082154906969169922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1020332031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020332081) 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 15 ways as a sum of consecutive naturals, for example, 10006 + ... + 46268.
It is an arithmetic number, because the mean of its divisors is an integer number (86816016).
Almost surely, 21020332031 is an apocalyptic number.
1020332031 is a deficient number, since it is larger than the sum of its proper divisors (368724225).
1020332031 is a wasteful number, since it uses less digits than its factorization.
1020332031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36462.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 1020332031 is about 31942.6365693253. The cubic root of 1020332031 is about 1006.7319231827.
Adding to 1020332031 its reverse (1302330201), we get a palindrome (2322662232).
The spelling of 1020332031 in words is "one billion, twenty million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •