Base | Representation |
---|---|
bin | 11110000000101000101… |
… | …00010110111110001011 |
3 | 10122120112102201100000120 |
4 | 33000110110112332023 |
5 | 113343230024013311 |
6 | 2105410155234323 |
7 | 134332303106103 |
oct | 17002424267613 |
9 | 3576472640016 |
10 | 1031133032331 |
11 | 368334795986 |
12 | 147a104489a3 |
13 | 7630a30886c |
14 | 37c9b14c203 |
15 | 1bc4ea9d706 |
hex | f014516f8b |
1031133032331 has 8 divisors (see below), whose sum is σ = 1376154670800. Its totient is φ = 686766707712.
The previous prime is 1031133032329. The next prime is 1031133032351. The reversal of 1031133032331 is 1332303311301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1031133032331 - 21 = 1031133032329 is a prime.
It is a super-2 number, since 2×10311330323312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1031133032351) 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, 163824790 + ... + 163831083.
It is an arithmetic number, because the mean of its divisors is an integer number (172019333850).
Almost surely, 21031133032331 is an apocalyptic number.
1031133032331 is a deficient number, since it is larger than the sum of its proper divisors (345021638469).
1031133032331 is a wasteful number, since it uses less digits than its factorization.
1031133032331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327656925.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 1031133032331 its reverse (1332303311301), we get a palindrome (2363436343632).
The spelling of 1031133032331 in words is "one trillion, thirty-one billion, one hundred thirty-three million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •