Base | Representation |
---|---|
bin | 11110000010011100000… |
… | …00110111100001110011 |
3 | 10122200000220010020212021 |
4 | 33001032000313201303 |
5 | 113402220324020311 |
6 | 2110050214212311 |
7 | 134365265522131 |
oct | 17011600674163 |
9 | 3580026106767 |
10 | 1032101001331 |
11 | 368791121364 |
12 | 148040654097 |
13 | 76432a0c49a |
14 | 37d4d91c751 |
15 | 1bca9a54171 |
hex | f04e037873 |
1032101001331 has 8 divisors (see below), whose sum is σ = 1055820326400. Its totient is φ = 1008454998408.
The previous prime is 1032101001293. The next prime is 1032101001413. The reversal of 1032101001331 is 1331001012301.
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 1032101001331 - 211 = 1032100999283 is a prime.
It is a super-2 number, since 2×10321010013312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1032101001031) 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, 18302061 + ... + 18358366.
It is an arithmetic number, because the mean of its divisors is an integer number (131977540800).
Almost surely, 21032101001331 is an apocalyptic number.
1032101001331 is a deficient number, since it is larger than the sum of its proper divisors (23719325069).
1032101001331 is an equidigital number, since it uses as much as digits as its factorization.
1032101001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36661073.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1032101001331 its reverse (1331001012301), we get a palindrome (2363102013632).
The spelling of 1032101001331 in words is "one trillion, thirty-two billion, one hundred one million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •