Base | Representation |
---|---|
bin | 11110000010001100011… |
… | …10010100110010101101 |
3 | 10122122200210012111220021 |
4 | 33001012032110302231 |
5 | 113401433344430331 |
6 | 2110025225122141 |
7 | 134362120625554 |
oct | 17010616246255 |
9 | 3578623174807 |
10 | 1031970311341 |
11 | 368724379002 |
12 | 148004929351 |
13 | 76411911928 |
14 | 37d3a41cd9b |
15 | 1bc9d33b211 |
hex | f046394cad |
1031970311341 has 8 divisors (see below), whose sum is σ = 1045322700800. Its totient is φ = 1018699588368.
The previous prime is 1031970311327. The next prime is 1031970311353. The reversal of 1031970311341 is 1431130791301.
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 1031970311341 - 225 = 1031936756909 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031970311297 and 1031970311306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031970341341) 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, 20391186 + ... + 20441731.
It is an arithmetic number, because the mean of its divisors is an integer number (130665337600).
Almost surely, 21031970311341 is an apocalyptic number.
It is an amenable number.
1031970311341 is a deficient number, since it is larger than the sum of its proper divisors (13352389459).
1031970311341 is a wasteful number, since it uses less digits than its factorization.
1031970311341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40833243.
The product of its (nonzero) digits is 6804, while the sum is 34.
The spelling of 1031970311341 in words is "one trillion, thirty-one billion, nine hundred seventy million, three hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •