Base | Representation |
---|---|
bin | 1110001000101011001000… |
… | …10101011001001100010001 |
3 | 11002001122011121110002021022 |
4 | 13010111210111121030101 |
5 | 13033241233040312321 |
6 | 150035543020405225 |
7 | 6355525313344343 |
oct | 704254425311421 |
9 | 132048147402238 |
10 | 31084361650961 |
11 | 99a4892869a43 |
12 | 35a04359a6815 |
13 | 1446320366648 |
14 | 7966c3943293 |
15 | 38d8978bedab |
hex | 1c4564559311 |
31084361650961 has 8 divisors (see below), whose sum is σ = 31548434017440. Its totient is φ = 30620293010208.
The previous prime is 31084361650933. The next prime is 31084361651009. The reversal of 31084361650961 is 16905616348013.
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 31084361650961 - 214 = 31084361634577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31084361650861) 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, 19057850 + ... + 20624508.
It is an arithmetic number, because the mean of its divisors is an integer number (3943554252180).
Almost surely, 231084361650961 is an apocalyptic number.
It is an amenable number.
31084361650961 is a deficient number, since it is larger than the sum of its proper divisors (464072366479).
31084361650961 is a wasteful number, since it uses less digits than its factorization.
31084361650961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1862863.
The product of its (nonzero) digits is 2799360, while the sum is 53.
Adding to 31084361650961 its reverse (16905616348013), we get a palindrome (47989977998974).
The spelling of 31084361650961 in words is "thirty-one trillion, eighty-four billion, three hundred sixty-one million, six hundred fifty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •